Массив. Вывести четные числа в порядке убывания индексов

const
n=10;
var
a:array[1..n] of integer;
i,k:integer;
begin
for i:=1 to n do
begin
a[i]:=random(10);
write(a[i],' ');
end;
writeln;
for i:=n downto 1 do
begin
if a[i] mod 2=0 then
begin
write(a[i],' ');
inc(k);
end;
end;
writeln;
writeln('Êîë-âî = ',k);
end.

const
n=10;
var
a:array[1..n] of integer;
i,k:integer;
begin
for i:=1 to n do
begin
a[i]:=random(10);
write(a[i],' ');
end;
writeln;
for i:=1 to n do
begin
if a[i] mod 2<>0 then
begin
write(a[i],' ');
inc(k);
end;
end;
writeln;
writeln('Êîë-âî = ',k);
end.

8 6 4 1 5 4 0 5 1 0 
1 5 5 1 
Êîë-âî = 4

program primer3;
Uses WinCrt;
var  n,i,s:integer;
mas:array[1..10]of integer;
begin
write('vvedite razmer massiva');
readln(n);
for i:=1 to n do
begin
write('vvedite', ' element massiva');
read(mas[i]);
end;
s:=0;
for i:=1to n do
begin
if mas[i] mod 2=1 then
begin
writeln(mas[i]);
s:=s+1;
end;
end;
write('vsego  nechetnix elementov' ,s);
end.

for i:=1 to n do
begin
if mas[i] mod 2=1 then
begin
writeln(mas[i]);
s:=s+1;
end;

var  mas:array of integer;
n,i:integer;
begin
read(n);
setlength(mas,n);
for i:=0 to n-1 do
read(mas[i]);
writeln(mas);
i:=0;
while i<n do
begin
write(mas[i],' ');
i:=i+2;
end;
n:=n-n mod 2;
i:=n-1;
while i>0 do
begin
write(mas[i],' ');
i:=i-2;
end;
end.