在一维数组中统计奇数与偶数(用pascal做)

program jishu;
var a:array[1..10000]of longint;
n,i,count1,count2:longint;
begin
readln(n);count1:=0;count2:=0;
for I:=1 to n do begin
read(a[i]);
if a[i] mod 2=0 then inc(count2) else inc(count1);
end;
writeln('odd=',count1,' even=',count1);
end.

//FPC 2.2.2调试通过

program count;
var b:boolean;
a:array[0..1]of longint;
i:longint;
begin
read(i);
while i<>-9999 do
begin
b:=odd(i);
inc(a[ord(b)])
end;
writeln('jishu:',a[1],'ge oushu:',a[0],'ge')
end.
输入一串数，以-9999结尾，统计奇偶数数量

const
maxn = 10000;
var
sum: longint;
n,i: longint;
a : array [ 0..maxn ] of longint;

begin
readln( n );
for i:=1 to n do read( a[ i ] );
readln;
for i:=1 to n do if odd( a[ i ] ) then inc( sum );
writeln( sum );//奇数