/XOR1 - Phép XOR 1

<Problem>

http://ntucoder.net/Problem/Details/2224
              Uses Crt;
        Var n,i,j:longint;  kq,res:int64;
                a:array[1..1000001] of longint;
        Begin
            readln(n); res:=0; kq:=0;
            for i:=1 to n do begin read(a[i]);  if a[i] mod 2=0 then inc(kq) else inc(res); end;
            //for i:=1 to n-1 do
            //for j:=i+1 to n do begin kq:=a[i] xor a[j]; if kq mod 2<>0 then inc(res); end;
            writeln(res*kq);
            readln;
        End.