Найти и вывести произведение двузначных элементов массива, которые не делятся на 6

Program task;
var a: array of integer;
    n: integer;
 
function getProduct(a: array of integer; size: integer): integer;
var i: integer;
    res: integer;
begin
  res := 1;
  for i := 0 to size-1 do
  begin
    if (a[i] mod 6 <> 0) and (a[i] >= 10) and (a[i] < 100) then
    begin
      res := res * a[i]
    end;
  end;
  getProduct := res;
end;
procedure input();
var i: integer;
begin
  write('Enter the size of array: ');
  readln(n);
  setLength(a, n);
  write('Enter ', n,' integer numbers: ');
  for i := 0 to n-1 do
  begin
    read(a[i]);
  end;
end;
procedure outputArray(a: array of integer; size: integer);
var i: integer;
    sep: string = '';
begin
 for i := 0 to size-1 do
 begin
  write(sep, a[i]);
  sep:=', ';
 end;
 writeln;
end;
 
BEGIN
  input();
  writeln('Your array: ');
  outputArray(a,n);
  writeln('Product of two-digits numbers that is not divisible by 6: ', getProduct(a,n));
  
END.

const
  N = 10;
 
var
  A: array [0..N - 1] of integer;
  Mult: integer;
 
begin
  Mult := 1;
  
  for var i := 0 to N - 1 do
  begin
    Readln(A[i]);
    if (Abs(A[i]) >= 10) and (Abs(A[i]) < 100) and (Abs(A[i]) mod 6 <> 0) then Mult *= A[i];
  end;
  
  Writeln(Mult);
end.

begin
  Writeln(Arr(1, 50, 33, 60).Where(x -> (Abs(x) >= 10) and (Abs(x) < 100) and (Abs(x) mod 6 <> 0)).Aggregate((x, y)-> x * y));
end.