peterverebics/CodeNet_Python_118 huggingface dataset:
N, *X = map(int, open(0).read().split())

ans = 0
for i in range(N):
    if i % 2 == 1 and X[i] % 2 == 1:
        ans += 1
print(ans)
N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
    print(i)
    if (i%2 == 1) and (a[i-1]%2 == 1):
        ans += 1
print(ans)
N=int(input())

a=[0]*N
a=list(map(int,input().split()))
ans=0
for i in range(1,N,2):

    if(a[i]%2==1):
        ans=ans+1
print(ans)
X = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(0,X,2):
    if A[i]%2!=0:
        ans+=1
for i in range(1,X,2):
    if A[i]%2==0:
        ans+=1

print(ans)
n = int(input())
A = list(map(int, input().split()))
ans = 0
for i in A:
    if i % 2 == 1 and A.index(i) % 2 == 0:
        ans += 1
print(ans)
print(sum([int(i)%2 for i in input().split()[1::2]]))
n=int(input())
l=list(map(int, input().split()))
#print(l)
count = 0
for i in range(1,n,2):
    if l[i-1]%2 == 1:
        count += 1
print(count)
def main():
    N = int(input())
    numlist = list(map(int,input().split()))

    count = 0

    for i in range(len(numlist)):
        if i % 2 == 1:
            if numlist[i] % 2 == 1:
                count += 1
    
    print(count)

if __name__ == '__main__':
    main()
n = int(input())
alist = list(map(int, input().split()))

ans = 0
for aindex, a in enumerate(alist):
    if aindex % 2 != 0 and a % 2 != 0:
       ans += 1
print(ans)
n = int(input())
a = list(map(int,input().split()))
ans = 0
for i,ai in enumerate(a):
  if i%2 == 1 and ai%2 == 1:
    ans += 1
print(ans)
intArrLength = int(input())
intArr = list(map(int, input().split()))

oddCounter = 0
for i in range(intArrLength):
    if i % 2 != 0 and intArr[i] % 2 != 0:
        oddCounter += 1

print(oddCounter)
N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
  if i % 2 == 0:
    if A[i] % 2 == 0:
      ans += 1
print(ans)
# -*- coding: utf-8 -*-


N = input()
del N
I1 = input().split()

i = 0

for a in range(len(I1)):
    if int(I1[a]) * a % 2 == 1:
        i += 1

print(i)
N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(N):
  if(i%2==1):
    if(a[i]%2==1):
      ans += 1
print(ans)
n = int(input())
lis = list(map(int,input().split()))

cnt=0
n=0
for i in lis:
    if (i)%2 != 0 and n%2 != 0:
        cnt += 1
    n += 1
    print(n)
print(cnt)
n = int(input())
a = list(input().split())

a = [int(a[i]) for i in range(n)]
ans = 0
for j in range(n):
    if j%2 == 1 and a[j]%2 == 1:
        ans = ans + 1

print(ans)
n= int(input())
a_s= list(map(int, input().split(' ')))
count=0
for i in range(len(a_s)):
	if i%2==1:
		if a_s[i]%2==1:
			count+=1

print(count)
N = int(input())
A_list = list(map(int,input().split()))
count = 0

for i in range(N):
    if i % 2 == 1 and A_list[i] % 2 == 1:
        count += 1

print(count)
inpl = lambda: list(map(int,input().split()))
N = int(input())
A = inpl()
print(sum(A[i]%2 for i in range(1,N,2)))
n, *a = map(int, open(0).read().split())
ans = 0
for i in range(n):
    if i%2 and a[i]%2:
        ans += 1
print(ans)
N = int(input())
a = list(map(int, input().split()))

count = 0

for i in range(N):
    if ((a[i] % 2 == 1) and i % 2 == 1):
        count += 1

print(count)
n = int(input())
a = list(map(int,input().split()))

ans=0
for i in range(n):
    if i%2==1:
        if a[i]%2==1:
            ans+=1
print(ans)
def main():
    N = int(input())
    A = list(map(int, input().split()))
    ans = 0
    for i, a in enumerate(A):
        if i % 2 == a % 2 == 1:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()
N = int(input())
l = list(map(int,input().split()))

c = 0

for i in range(N):
    if i % 2 == 1 and l[i] % 2 == 1:
        c += 1

print(c)
N = int(input())
A = list(map(int, input().split()))
count=0
for i in range(N):
    if A[i] %2 ==1 & i %2 ==1:
        count +=1

print(count)
n=int(input())
a=[int(i) for i in input().split()]
ans=0
for i in range(n):
    if(a[i]%2==1 and i%2==1):
        ans+=1

print(ans)
n=int(input())
a=list(map(int, input().split())) 
ans = 0

for i in range(n):
    if i % 2 == 1 and a[i] % 2 == 1:
        ans += 1

print(ans)
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = inpl()
res = 0
for i,x in enumerate(a):
    if i%2 and x%2:
        res += 1
print(res)
n=int(input())
count=0
a=list(map(int,input().split()))
for i in range(len(a)-1):
    if a[i]%2!=0 and i%2!=0:
        count+=1
print(count)
n = int(input())
a = [1 for i in list(map(int, input().split()))[1::2] if i % 2 == 1]
print(len(a))
# B

N=int(input())
a=list(map(int,input().split()))

ans=0
for i in range(N):
    if a[i]%2==1 and i%2==1:
        ans +=1
print(ans)
n=int(input())
count=0
a=list(map(int,input().split()))
for i in range(len(a)):
    if a[i]%2!=0 and i%2!=0:
        count+=1
print(count)
import math
N=int(input())
a=list(map(int,input().split()))
ans=0

for i in range(N):
    if (i%2!=0)and(a[i]%2!=0):
        ans+=1

print(ans)
N = int(input())
a = list(map(int,input().split()))

ans = 0
for i in range(1,N,2):
    if a[i]%2==1:
        ans+=1

print(ans)
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i, a in enumerate(A):
    if i % 2 == 1 and a % 2 == 1:
        ans += 1
print(ans)
#B
N = int(input())
a = list(map(int, input().split()))

count = 0
for i, v in enumerate(a):
    if i % 2 != 0:
        if v % 2 != 0:
            count += 1

print(count)
n = int(input())
s = list(map(int,input().split()[:n]))
a = 0
for i in range(1,len(s)):
  if((i%2 == 0) and (s[i]%2 !=0)):
    a+=1
print(a)
N = int(input())
A = list(map(int,input().split()))
cnt = 0
for i in range(1,N,2):
    if A[i]%2 == 1:
        cnt += 1
print(cnt)
n=map(int,input().split())
a=list(map(int,input().split()))

N=0
new_a=a[1::2]

for i in new_a:
    if i%22==0:
        N += 1

print(len(new_a)-N)
n=int(input())
l=list(map(int, input().split()))
#print(l)
count = 0
for i in range(1,n,2):
    if l[i]%2 == 1:
        count += 1
print(count)
N = int(input())
a=list(map(int,input().split()))
cnt=0
for i in range((N+1)//2):
    print(i)
    if a[2*i] % 2 == 1:
        cnt += 1
print(cnt)
N = int(input())
A = list(map(int,input().split()))
ans = 0

for n in range(N):
  if n%2==1 and A[n]%2==1:
    ans+=1
    
print(ans)
N = int(input())
a = list(map(int, input().split()))

ans = sum(1 for i, j in enumerate(a) if i % 2 == 1 and j % 2 == 1)

print(ans)
n = int(input()) 
a = list(map(int,input().split())) 

odd = a[1::2]
ans = 0
for i in range(len(odd)):
    if odd[i]%2 == 1:
        ans = ans + 1

print(ans)
n = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(len(a)):
    if ((i % 2) == 0):
        continue
    if ((a[i] % 2) != 0):
        ans += 1

print(ans)
N=int(input())
A=list(map(int,input().strip().split()))
c=0
for i in range(1,N):
	if (i+1)%2!=0 and A[i]%2!=0:
		c+=1
print(c)
N = int(input())
a = [int(i) for i in input().split()]
ans = 0

for i in range(1,N):
    if i%2 == 1 and a[i]%2 == 1:
        ans += 1

print(ans)
n=int(input())
a=list(map(int,input().split()))

ans=0
for i in range(1,n,2):
    if a[i]%2==1:
        ans+=1

print(ans)
n = int(input())
a = list(map(int,input().split()))

count = 0
for i,num in enumerate(a):
    if i%2==1 and num%2==1:
        count+=1


print(count)
# -*- coding: utf-8 -*-
import math

N = int(input())
# print(N)
ai = input().split(' ')
# print(ai)
num = 0
for i in range(math.floor(N/2)):
    if int(ai[i*2]) % 2 == 1:
        num += 1

print(num)
N = int(input())
A = list(map(int, input().split()))
ans = 0

for i in range(len(A)):
    if i%2==1 and A[i]%2==1:
        ans += 1
print(ans)
input()
a = list(map(int, input().split()))

sum([ai % 2 for ai in a[::2]])
n=int(input())
a=list(map(int,input().split()))
co=0
for i in range(n):
  if i%2==0 and a[i]%2==1:
    co+=1
print(n)
N = int(input())
a = list(map(int, input().split()))
C = 0
for i in range(1, len(a), 2):
    if a[i] % 2 == 1:
        C += 1
print(C)
import itertools
import decimal
import math
import collections
import sys
#input = sys.stdin.readline
import copy

# S=(input())
# N=int(input())
# N,K=map(int,input().split())
# ListA=list(map(int,input().split()))
# ListA.sort()#reverse=True)

def resolve():
    
    N=int(input())
    ListA=list(map(int,input().split()))

    cnt=0
    for i in range(N):
        if(i%2==1 and ListA[i]%2==1):
            cnt+=1

    print(cnt)



resolve()
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N):
    if A[i] %2 == 1:
        if i %2 == 1:
            ans += 1
print(ans)
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N):
    if (i*A[i]) % 2 == 1:
        ans += 1
print(ans)
def main():
    n = int(input())
    A = list(map(int,input().split()))
    ans = 0
    for i in range(n):
        if i%2 == 1 and A[i]%2 == 1:
            ans += 1
    print(ans)
    return
if __name__ == "__main__":
    main()
#!/usr/bin/env python3

def main():
    N = int(input())
    a = list(map(int, input().split()))

    ans = 0
    for i in range(N):
        if i % 2 == 1 and (a[i] % 2 == 1):
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()
def main():
    n = int(input())
    a = tuple([int(t)for t in input().split()])

    ans = 0
    for i in range(n):
        if i%2==1 and a[i] %2 == 1:
            ans+=1
    print(ans)
if __name__ == "__main__":
    main()
N=int(input())
a=list(map(int,input().split()))
count=0
for i in range(N):
	if i%2==1 and a[i]%2==1:
		count+=1

print(count)
N=int(input())
A=list(map(int,input().split()))

ans=0
for a_idx ,a in enumerate(A):
    if a_idx%2 !=0 and a%2 !=0:
        ans+=1
print(ans)
N = int(input())
list = list(map(int, input().split()))
cnt = 0
li = []
for count, i in enumerate(list):
    if count %2 ==1:
        li.append(i)

for j in range(len(li)):
    if li[j] %2 ==1:
        cnt +=1
print(cnt)
n,*a=map(int,open(0).read().split())
print(len([x for x in a if (x%2!=0 and (a.index(x)+1)%2!=0)]))
input()
A = [a for i, a in enumerate(input().split()) if 1 & i & int(a) == 1]

print(len(A))
N=int(input())
a=list(map(int,input().split()))
b=[a[i] for i in range(1,N,2)]
c=0
for i in b:
    if i%2==1:
        c+=1
print(c)
n = int(input("Enter your limit : "))
s = list(map(int,input().split()[:n]))
a = 0
for i in range(1,len(s)):
  if((i%2 != 0) and (s[i]%2 !=0)):
    a+=1
print(a)
n=int(input())
a=list(map(int,input().split()))

print( sum(i%2==1 and a[i]%2==1 for i in range(n)) )
n = int(input())
a = list(map(int, input().split()))

cnt = 0
for i in range(len(a)):
    if i % 2 and a[i] % 2:
        cnt += 1
print(cnt)
'''
5
1 3 4 5 7
'''
lens = int(input())
vals = [int(x) for x in input().split()]
odds = 0
for i in range(lens):
  if i % 2 == 0 and vals[i] % 2 == 0:
    odds += 1
print(odds)
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
      if i % 2 == 1 and a[i] % 2 == 1:
            ans += 1
print(ans)
n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
    if i % 2 == 1 and a[i] % 2 == 1:
        count += 1
print(count)
#!/usr/bin/env python

n = int(input())
a = list(map(int, input().split()))

ans = 0 
for i in range(n):
    if i%2==1 and a[i]%2==1:
        ans += 1
print(ans)
import sys

N = int(sys.stdin.readline())
#L,R,d = map(int, sys.stdin.readline().split())

ans = 0

for i,n in enumerate(map(int, sys.stdin.readline().split())):
    if i % 2 == 0:
        continue
    if n % 2 == 0:
        continue
    ans += 1


print(ans)
N=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(N):
  if (i+1)%2==0 and a[i]%2!=0:
    ans+=1
print(ans)
n = int(input())
#a,b = map(int,input().split())
a_L = list(map(int,input().split()))

ans = 0
for i in range(n):
    if i%2!=0 and a_L[i] !=0:
        ans += 1

print(ans)
N = int(input())
A = [int(x) for x in input().split()]
ans = 0
for i in range(N):
    if A[i]%2 == 1 and i%2 == 1:
        ans += 1
print(ans)
a=[input() for i in range(2)]
a1=int(a[0])
a2=[int(i) for i in a[1].split()]

count=0

for i in range(len(a2)):
	if i%2==1:
		if a2[i]%2==1:
			count+=1

print(count)
n=int(input())
a=list(map(int,input().split()))


ans = []
for i in range(n):
    if (i+1)%2==0 and a[i]%2==1:
        ans.append(i)
print(len(ans))
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

n = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(n):
    if i%2 == 1:
        if a[i]%2 == 1:
            ans += 1
print(ans)
N = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(N):
    if i%2 != 0:
        if a[i]%2 != 0:
            ans += 1
print(ans)
N = int(input())
lst = list(map(int, input().split()))

unko = 0
for i in range(len(lst)):
    if i % 2 == 0 or lst[i] % 2 == 0:
        continue
    else:
        unko += 1
print(unko)
#B
N =  int(input())
a = list(map(int,input().split()))
cou = 0

for i in range(N):
    if i %2 == 1 and a[i] %2 ==1:
        cou += 1

print(cou)
n = int(input())
arr = list(map(int, input().split()))
res = 0
for a in arr[1::2]:
    if a % 2 == 1:
        res += 1
print(res)
#!/usr/bin/env python3

input()
A = input().split(' ')
A = list(map(int, A))

ret = 0
for i, a in enumerate(A):
    if i % 2 == 1 and a % 2 == 1:
        ret += 1

print(ret)
import sys
N = int(input())
a = list(map(int, sys.stdin.readline().strip().split()))

ans = 0
for i in range(1, N, 2):
    if a[i]%2 == 1:
        ans += 1
print(ans)
def main():
    no = int(input())
    maths = map(int,input().split())
    
    count = 0
    for index,math in enumerate(maths):
        if index % 2==1 and math %2==1:
            count+=1
    print(count)


if __name__ == "__main__":
    main()
N = int(input())
a = [int(i) for i in input().split()]
h = 0
for s in range(N) :
  if s % 2 == 1:
    if a[s] % 2 == 1:
      h += 1
print(h)
#!/usr/bin/env python3

import sys

input = iter(sys.stdin.read().splitlines()).__next__


sys.setrecursionlimit(10000)

N = int(input())
A = list(map(int, input().split()))

res = len([1  for i in range(N) if i % 2 == 1 and A[i] % 2 == 1 ])
print(res)
n = int(input())
a = list(map(int,input().split()))
ans =[]
for i in range(len(a)):
  if i%2 == 0:
    continue
  else:
    ans.append(a[i])

print(len([i for i in ans if i % 2 != 0]))
n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
    if i % 2 == 0 and a[i] % 2 != 0:
        print(i, a[i], cnt)
        cnt += 1
print(cnt)
N = int(input())
a = list(map(int,input().split()))

res = 0
for i in range(N):
    if i%2 == 1 and a[i]%2  == 1:
        res += 1

print(res)
# -*- coding: utf-8 -*-

n = int(input())
a_list = list(map(int, input().split()))
ans = 0

for i in range(len(a_list)):
  if i % 2 == 1:
    if a_list[i] % 2 == 1:
      ans += 1
      
      
print(ans)
N = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(1, N, 2):
    if A[i]%2==1:
        ans+=1
print(ans)
n=int(input())
a = list(map(int,input().split()))
count=0
for i in range(n):
    if i%2==1 and a[i]%2==1:
        count+=1
print(count)
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
    if i%2 != 0 and a[i]%2 != 0:
        ans+=1
print(ans)
in_str = input()
N = int(in_str)
in_list = input().split(' ')
count = int(N/2) + 1
index = 0

while index <= (N-1):
    if int(in_list[index])%2==0:
        count -= 1
    index += 2

print(count)
n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i, j in enumerate(a):
    if i % 2 != 0 and j % 2!=0:
        cnt += 1
print(cnt)
N = int(input())
a=list(map(int,input().split()))
cnt=0
for i in range((N+1)//2):
    if a[2*i-1] % 2 == 1:
        cnt += 1
print(cnt)
N = int(input()) 
masu_list = list(map(int, input().split()))
result = 0

for i, masu in enumerate(masu_list):
    if i % 2 == 1:
        if masu % 2 == 1:
            result = result + 1

print(result)
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in a[1::2]:
  ans+=i%2
print(ans)
N = int(input())
ans = 0
for n in range(1, N+1):
    for x in range(1, 101):
        for y in range(1, 101):
            for z in range(1,101):
                if x**2 + y**2 + z**2 + x*y + y*z + z*x == n:
                    ans+=1
    print(ans)
    ans=0
N = int(input())
a = list(map(int, input().split()))
count = 0

for i in range(N):
    if i % 2 == 1 and a[i] %2 == 1:
        count += 1

print(count)
N=int(input())
A=list(map(int,input().split()))
ans=0

for i in range(N):
    if i % 2==1 and A[i] %2 ==1:
        ans+=1
print(ans)
N = int(input())
A = list(map(int, input().split()))
cnt=0
for i in range(N):
    if A[i]%2==1 and i%2==1:
        cnt+=1
print(cnt)
N = int(input())
arr = list(map(int, input().split()))
result = 0
for i in range(0,len(arr)):
    if i%2!=0 and arr[i]%2!=0:
        result +=1
print(result)
ans=0
n=int(input())
for i,v in enumerate(list(map(int,input().split()))):
    if i%2 and v%2:ans+=1
print(ans)
n = int(input())
l = list(map(int, input().split()))

l1 = l[0::2]
cnt = 0
for i in l1:
    if i % 2 == 1:
        cnt += 1
print(l1)
N = int(input())
a = list(map(int, input().split()))
count = 0

for i in range(1, N, 2):
    if a[i] % 2 == 1:
        count += 1

print(str(count))
n = int(input())
mas = list(map(int,input().split()))

mlen = len(mas)
kiss = 0
ans = 0

if n % 2 == 0:
    kiss = n / 2
else:
    kiss = ((n - 1) / 2) + 1
kiss = int(kiss)
for i in mas:
    i % 2 != 0
    ans += 1

ans1 = ans + kiss
print(ans1)
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

n=int(input())
a=lmp()
ans=0
for i in range(n):
    if i%2==1 and a[i]%2==1:
        ans+=1
print(ans)
N = int(input())
a = [int(x) for x in input().split()]
count = 0
for i in range(N):
    if i % 2 == 1 and a[i] % 2 == 1:
        count += 1
print(count)
import copy

def main():
    N = int(input())
    l = list(map(int, input().split()))
    c = 0
    for i in range(N):
        if (i + 1) % 2 == 0 and l[i] % 2 == 1:
          c = c + 1
    print(c)
main()
n = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(n):
    if i % 2 == 1:
        if a[i] % 2 == 1:
            ans += 1
print(ans)
n = int(input())
string = input()
num_list = [int(i) for i in string.split()]
count = 0
for i in range(1, n-1):
  if i % 2 == num_list[i] % 2 == 1:
    count += 1
print(count)
N = int(input())
*A, = map(int, input().split())
ans = 0
for i, a in enumerate(A):
    if i & 1 and a & 1:
        ans += 1
print(ans)
n = int(input())
a = list(map(int, input().split()))

cnt = 0

for i in range(len(a)):
    if (i % 2 == 1) and (a[i] % 2 == 1):
        cnt += 1

print(cnt)
import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int,input().split()))
ans = 0

for i in range(N):
    if (((i*1) * A[i]) % 2) == 1:
        ans += 1
print(ans)
N = int(input())
num_list = list(map(int, input().split()))
ans = 0

for i in range(0,len(num_list)):
   if num_list[i]%2 == 1 and (num_list.index(num_list[i])+1)%2 == 1:
       ans += 1

print(ans)
N = int(input())
a = list(map(int,input().split()))
count = 0 
for i,j in enumerate(a):
    if(i%2==1):
        if(j%2 == 1):
            count +=1
print(count)
n=int(input())
l=list(map(int,input().split()))
count=0
for i in range(n):
    if i%2==1 and l[i]%2==1:
        count+=1
print(count)
n = int(input())
string = input()
num_list = [int(i) for i in string.split()]
count = 0
for a, i in enumerate(num_list):
  if a+1 % 2 == i % 2 == 1:
    count += 1
print(count)
N = int(input())
A = list(map(int, input().split()))

count = 0
for a in A:
  if (a % 2 != 0):
    if A.index(a) %2 != 0:
      count += 1
print(count)
suu = int(input())
lis = input().split()
lis = [int(lis)for lis in lis]


count= 0
for i in range(len(lis)):
    if i%2 != 0 and lis[i] % 2 !=0 :
        count += 1


print(count)
n = input()
num = list(map(int,input().split()))
print(num)
# mul = int(input().split())
cnt = 0
for i in range(1,len(num),2):
    if(num[i] % 2 != 0):
        cnt += 1
print(cnt)
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(1,n,2):
    if a[i]%2==1:
        ans+=1
print(ans)
N = int(input())
A = list(map(int, input().split()))
cnt = 0

for i in range(len(A)):
    if i%2 != 0 and A[i]%2 != 0:
        cnt += 1
        
print(cnt)
N = int(input())
a = list(map(int,input().split()))
count=0
for i in range(N-1):
    if(i%2==1 and a[i]%2==1):
        count+=1
print(count)
N=int(input())
li = list(map(int,input().split()))
coun=0
for i,h in enumerate(li):
  if i+1 % 2 == 1 and h % 2 == 1:
    coun+=1
print(coun)
import numpy as np
N = int(input())
a = list(map(int, input().split()))

a = a[1::2]
a = np.array(a)


print(np.count_nonzero(a%2 != 0))
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

if __name__=='__main__':
    n = I()
    a = list(IL())
    c = 0
    for i,item in enumerate(a):
        if i%2==0:  continue
        if item%2==1:   c+=1
    print(c)
    exit()
print(sum([int(i)%2 for i in input().split()[::2]]))
n = int(input())
m = input()
lst = m.split(" ")
num = 0
list2 = [int(i) for i in lst]
if(len(lst)==n):
    for elem in list2:
        if(elem%2==0 or elem%3==0 or elem%5==0):
            if(list2.index(elem)%2==0 or list2.index(elem)%3==0 or list2.index(elem)%5==0):
                num += 1
print(num)
n=int(input())
l=[int(X) for X in input().split()]
c=0
for i in range(1,len(l),1):
  if l[i]%2 !=0 :
    c+=1
print(c)
def main():
    N = input_ints()

    a = input_int_list_in_line()

    print(len([True for i in range(N) if i % 2 == 0 and a[i] % 2 == 0]))




def input_ints():
    line_list = input().split()

    if len(line_list) == 1:
        return int(line_list[0])
    else:
        return map(int, line_list)


def input_int_list_in_line():
    return list(map(int, input().split()))


def input_int_tuple_list(n: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()
N=int(input())
a = list(map(int, input().strip().split()))
ans=0
i=0
for _ in range(N):
  if(i % 2 == 1 and a[i] % 2 == 1):
  	ans+=1
  i+=1
print(ans)
n=int(input())
a=list(map(int,input().split()))
ans=0
for num , i  in enumerate(a):
    if num%2==1 and i%2==1:
        ans+=1
print(ans)
n = int(input())
a = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
    if a[i]%2==1 and i%2==1:
        cnt +=1
print(cnt)
n = int(input())
a = list(map(int,input().split()))
ans =[]

for i in range(len(a)):
  if i%2 == 0:
    ans.append(a[i])
    continue
  else:
    continue
print(ans)
print([i for i in ans if i % 2 != 0])
print(len([i for i in ans if i % 2 != 0]))
n = int(input())
l = list(map(int,input().split()))
cnt = 0
for i in range(n):
    if i%2==1 and l[i] %2 == 1:
        cnt += 1
print(cnt)
n=map(int,input().split())
a=list(map(int,input().split()))

N=0
new_a=a[1::2]

for i in new_a:
    if i%2==0:
        N += 1

print(len(new_a)-N)
def main():
    n = int(input())
    
    a = list(map(int,input().split()))

    count = 0
    for i in range(n):
        if i%2==1 and a[i]%2==1:
            count+=1
    print(count)
    
if __name__=='__main__':
    main()
n = int(input())
num = list(map(int,input().split()))
print(num)
# mul = int(input().split())
cnt = 0
for i in range(2,n+1,2):
    if(num[i-1] % 2 != 0):
        cnt += 1
print(cnt)