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

program LR5_2;
uses Crt;
const max=10000;
Var i,n,t,y:integer;
a:array [1..max] of integer;
b:array [1..max] of integer;
Begin
writeln('vvedite kol-vo elementov v 1-om i 2-om massivah');
readln(i,t);
y:=0;
for n:=1 to i do
begin
writeln('vvedite elementy 1 massiva');
readln(a[n]);
end;
for n:=1 to t do
begin
writeln('vvedite elementy 2 massiva');
readln(b[n]);
end;
if t>i then
begin
for n:=1 to i do
begin
if(a[i] mod 2=0) and (b[i] mod 2=0) then
y=y+1;
end;
end;
if t<i then
begin
for n:=1 to t do
begin
if(a[i] mod 2=0) and (b[i] mod 2=0) then
y:=y+1;
end;
writeln(y);
end;
if t=i then
begin
for n:=1 to t do
begin
if(a[i] mod 2=0) and (b[i] mod 2=0) then
y:=y+1;
end;
end;
writeln(y);
end.

program LR5_2;
 
uses Crt;
const max=10000;
Var i,n,t,y:integer;
a:array of integer;
b:array of integer;
 
Begin
writeln('vvedite kol-vo elementov v 1-om i 2-om massivah');
readln(i,t);
y:=0;
 
SetLength(a,i);
SetLength(b,t);
 
for n:=0 to i-1 do
begin
writeln('vvedite elementy 1 massiva');
readln(a[n]);
end;
 
for n:=0 to t-1 do
begin
writeln('vvedite elementy 2 massiva');
readln(b[n]);
end;
 
if t>i then
begin
for n:=0 to i-1 do
begin
if(a[n] mod 2=0) and (b[n] mod 2=0) then y=y+1;
end;
end;
 
if t<=i then
begin
for n:=0 to t-1 do
begin
if(a[n] mod 2=0) and (b[n] mod 2=0) then y:=y+1;
end;
//writeln(y);
end;
 
finalize(a);
finalize(b);
 
writeln(y);
readln;
end.