Вычисление полинома по схеме Горнера — Pascal(Паскаль)

program p;

uses crt;

type
  mas = array [0 .. 5] of real;

var
  x: real;
  a: mas;
  i, j, n: integer;

function f1(x: real; a: mas): real;
var
  b0, b: real;
begin
  b0 := a[0];
  for i := 1 to n do
  begin
    b := a[i] + b0 * x;
    b0 := b;
  end;
  f1 := b;
end;

begin
  write('n=');
  readln(n);
  write('x=');
  readln(x);
  for i := 0 to n do
  begin
    write('a[', i, ']=');
    readln(a[i]);
  end;
  writeln('Rezul''tat: ', f1(x, a):5:1);

end.