peterverebics/CodeNet_Python_118 huggingface dataset:
N = int(input())
a = list(map(int, input().split()))

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

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

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

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


N = I()
A = LMI()
ans = 0
for i, a in enumerate(A):
    if i % 2 == 0 and a % 2 != 0:
        ans += 1
print(ans)
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(i,end='=>')
        #print(a[i])

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

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

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

for i in range(1,N+1):
    if a[i-1] % 2 != 0 and i % 2 != 0:
        ans+=1
print(ans)
N = int(input())
l = map(int, input().split())
res=0
for i, v in enumerate(l):
    if v % 2 == 1 and (i + 1) % 2 == 1:
        res += 1
        
print(res)
in_1 = input()
in_2 = input()

N = int(in_1)
a = in_2.split()

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N, *A = map(int, read().split())

ans = 0
for i, x in enumerate(A):
    if i % 2 == 0 and x % 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 and a[i]%2==1:
    ans += 1
print(ans)
N = int(input())
AA = list(map(int,input().split()))
cnt = 0
for i in range(0,N,2):
  if AA[i]%2==1:
    cnt+=1
print(cnt)
N = int(input())
data = list(map(int, input().split()))

data = data[0::2]

cnt = 0

for i in data:
  if i % 2 == 1:
    cnt += 1
    
print(cnt)
N = int(input())
A = [int(s) for s in input().split()]

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

print(cnt)
#AIsing2020 b

import sys,math,collections,itertools
input = sys.stdin.readline

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

cnt = 0
for n1, i in enumerate(a):
    if n1 % 2 == 0:
        if i % 2 == 1:
            cnt += 1
print(cnt)
n = int(input())
la = [int(w) for w in input().split()]

ans = 0

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

ans = 0
for i, a in enumerate(A):
    if i%2 == 0 and a%2 == 1:
        ans += 1
print(ans)
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

N = int(input())
As = list(mapint())

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

print(ans)
N, *A = map(int, open(0).read().split())
cnt = 0
for i, a in enumerate(A):
    if (i+1) & 1 and a & 1:
        cnt += 1
print(cnt)
def main():
    no = int(input())
    maths = map(int,input().split())
    
    count = 0
    for index,math in enumerate(maths):
        if index % 2==0 and math %2==1:
            count+=1
    print(count)


if __name__ == "__main__":
    main()
n=int(input())
a=list(map(int,input().split()))[::2]
c=0
for i in a:
  c+=(i%2)
print(c)
n = int(input())
l = list(map(int,input().split()))
ans = 0
for i in range(len(l)):
    if ((i+1)%2 == 1) and (l[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+1) % 2 and a[i] % 2: ans += 1
print(ans)
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, = map(int, input().split())
ans = 0
for i, a in enumerate(A, 1):
    if i % 2 == 1 and a % 2 == 1: ans += 1
print(ans)
N = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(N):
    if (i%2==0) and (a[i]%2 == 1):
        ans += 1
print(ans)
#!/usr/bin/env python3

import sys
input=sys.stdin.readline

n=int(input())
arr=list(map(int,input().split()))
cnt=0
for i in range(n):
    if i%2==0 and arr[i]%2==1:
        cnt+=1
print(cnt)
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()
input()
print(sum([int(x) % 2 for x in input().split()[::2]]))
n = int(input())
a = list(map(int, input().split()))
res = 0
for i in range(0, n, 2):
    if a[i] % 2 != 0:
        res += 1

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

ans = 0
for i,a in enumerate(A):
    if (i+1)%2:
        if a%2:
            ans += 1
print(ans)
N = int(input())
i = list(map(int, input().split())) #i_1 i_2を取得し、iに値を入れる

s = 0

for j in range(0,N,2):
  if i[j] % 2 == 1 :
    s += 1
print(s)
import sys


def main():
    input = sys.stdin.buffer.readline
    n = int(input())
    a = list(map(int, input().split()))
    ans = 0
    for i in range(0, n, 2):
        ans += a[i] % 2 == 1
    print(ans)


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

cnt = 0

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

print(cnt)
N = int(input().strip())
a = [int(v) for v in input().strip().split(" ")]

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

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

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


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

counter = 0

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

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


answer = 0
for i, e in enumerate(a):
    i += 1
    if i % 2 != 0 and e % 2 != 0:
        answer += 1 
print(answer)
import sys

n, *aaa = map(int, sys.stdin.buffer.read().split())
ans = 0
for i, a in enumerate(aaa, start=1):
    if i % 2 == 1 and a % 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+5,2):
    if(N<i):
        break
    if(a[i-1]%2==1):
        ans=ans+1
print(ans)
n = int(input())
l = list(map(int, input().split()))
ans = 0
for i in range(n):
    if i % 2 == 0 and l[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+1)%2 == 1 and A[i]%2 == 1:
        ans += 1
print(ans)
N,*A=map(int,open(0).read().split());print(len([i for i in A[::2]if i%2]))
n=int(input())
l = [int(x) for x in input().split(' ')]
c=0
for i in range(0,len(l),2):
  if((i+1)%2!=0 and l[i]%2!=0):
    c+=1
	  
print(c)
import sys
sys.setrecursionlimit(10**6)

n = int(input())
A = list(map(int, input().split()))
#n, m = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

ID = [i for i in range(1,n+1)]

ans = 0

for i,a in zip(ID, A):
    if i%2 == 1 and a%2 == 1:
        ans += 1
        
print(ans)
n = int(input())
nums = [int(x) for x in input().split()]
nums_v2 = []
nums_v3 = []

for i in range(len(nums)):
      if (i+1)%2 == 1:
            nums_v2.append(nums[i])

for i in range(len(nums_v2)):
      if nums_v2[i]%2 == 1:
            nums_v3.append(nums_v2[i])

print(len(nums_v3))
N = int(input())
a =list(map(int,input().split()))
b=[]

for i in range(N):
    a1 = i % 2
    a2 = a[i] % 2
    if (a1==0 and a2==1):
        b.append(i)
print(len(b))
n = int(input())
a = list(map(int, input().split()))

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

print(ans)
n = int(input())
a = list(map(int, input().split()))
ans = a[0::2]
cnt = 0

for i in range(len(ans)):
  if (ans[i] % 2) != 0:
    cnt += 1
    
print(cnt)
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

N=one_int()

A=many_int()

count=0
for i in range(0, len(A),2):
    if 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 + 1) % 2 == 1 and a[i] % 2 == 1):
        ans += 1

print(ans)
N=int(input())
a=list(map(int,input().split()))
print(sum(i%2==1 for i in a[::2]))
N = int(input())
li = []
for i in input().split():
    li.append(int(i))

a = 1
count = 0
for i in li:
    if a % 2 == 1 and i % 2 == 1:
        count += 1
    a += 1
print(count)
n = int(input())
listA = list(map(int, input().split()))

count = 0
for i in range(len(listA)):
    if (i+1)%2 == 1 and listA[i]%2 == 1:
        count+=1
print(count)
import sys

if __name__ == "__main__":
    N = int(sys.stdin.readline())
    A = list(map(lambda x: int(x), sys.stdin.readline().split()))
    
    ans = 0
    for i, a in enumerate(A):
        if i%2==0 and a % 2 == 1:
            ans += 1
        
    print(ans)
# coding: utf-8

import math
import re
import numpy as np
import copy

#読み込む
N = int(input())
an = list(map(int, input().split(' ')))
ans = 0

for i in range(N):
    if (i+1) % 2 == 0:
        continue
    elif an[i] % 2 != 0:
        ans += 1

print(ans)
x=int(input())
y=list(map(int, input().split()))
res=0
for i in range(0,x,2):
  if y[i]%2:
    res+=1
print(res)
n=int(input())
c=0
seq=list(map(int,input().split()))
for i in range(n):
    if i%2==0:
        if seq[i]%2!=0:
            c+=1
print(c)
def main():
    N = int(input())
    A = list(map(int, input().split()))

    ans = len([a for a in A[::2] if a % 2 == 1])
    print(ans)

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

ans = 0

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

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

#print(a)

cnt = 0

for i in range(n):
  #print(i)
  if (i+1)%2 ==1:
    if a[i]%2 ==1:
      cnt +=1
        
print(cnt)
how_many = int(input())
results = []
index = 0
numbers = {index+1:int(item) for index,item in zip(range(how_many),input().split())}
for key_value in numbers.items():
  if key_value[0] % 2 == 1 and key_value[1] % 2 == 1:
    results.append(True)
print(len(results))
import math

n = int(input())
aL = list(map(int, input().split(" ")))

ans = 0
for index, a in enumerate(aL):
    if (index + 1) % 2 == 1 and a % 2 == 1:
        ans += 1

print(ans)
N = int(input())
A = list(map(int,input().split()))
O = [i for i in range(N) if(i%2==0 and A[i]%2==1)]
print(len(O))
#template
def inputlist(): return [int(j) for j in input().split()]
#template
N = int(input())
a = inputlist()
count = 0
for i in range(N):
    if i % 2 == 0 and a[i] % 2 == 1:
        count +=1
print(count)
def main():
    n = int(input())
    a = list(map(int, input().split()))
    cnt = 0
    for i in range(n):
        if (i+1) % 2 == 1 and (a[i]) % 2 == 1:
            cnt += 1
    print(cnt)


main()
n = int(input())
a = 0
l = list(map(int, input().split()))
for i in range(n):
  if i % 2 == 0:
    if l[i] % 2 != 0:
      a = a + 1
print(a)
N = int(input())
A = list(map(int,input().split()))
An = 0
for i in range(N):
    if (i+1)%2 == 1:
        if A[i]%2 == 1:
            An +=1
print(An)
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)
def AnOddProblem():

    num = int(input())
    
    num_1 = list(map(int,input().split()))

    count = 0

    for i in range(num):
        mod_1 = num_1[i] % 2
        mod_2 = (i + 1) % 2
        
        if mod_1 == 1 and mod_2 == 1:
            count = count + 1
    
    print(count)

if __name__ == '__main__':
    AnOddProblem()
N = int(input())
A = list(map(int, input().split()))

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

print(answer)
n=int(input())
a=[int(i) for i in input().split()]
c=0
for i in range(0,len(a),2):
    d=i+1
    if(d%2!=0 and a[i]%2!=0):
        c=c+1
print(c)
N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
  if i%2 ==0:
    if A[i]%2 ==1:
      ans += 1
    else:
      ans += 0
  else:
   ans += 0 
print(ans)
N = int(input())
li = list(map(int,input().split()))
counter = 0
for i in range(N):
    if i%2==0:
        if li[i]%2==1:
            counter +=1

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

for i in range(0,n,2):
  if l[i]%2!=0:
    ans+=1
print(ans)
import sys
readline = sys.stdin.buffer.readline

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

ans = 0
for i, a in enumerate(A):
    if (i+1)%2 == 1 and a%2 == 1:
        ans += 1
print(ans)
n = input()
ans = 0
for i,j in enumerate(map(int,input().split())):
    ans += (~i&1 and j&1)
print(ans)
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
    if (i+1)%2 == 1 and a[i]%2 == 1:
        ans += 1
print(ans)
n = int(input())
an = list(map(int,input().split()))

cnt = 0
for ai in an[::2]:
    if ai % 2 != 0:
        cnt+=1

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

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

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

ans = 0
for i in range(0, len(A), 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(len(a)):
    if((i+1)%2 == 1 and a[i]%2 == 1):
        count+=1
print(count)
N = int(input())

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

count = 0

for i in range(0,N):
    if i == 0 or i % 2 == 0:
        if a[i] % 2 != 0:
            count += 1
    
print(count)
import numpy as np

N = int(input())
a = np.array([int(s) for s in input().split()])

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

ans = 0

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

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

      
print(ans)
import sys

def L(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())

def solver(N,A):
    ans = 0

    for i,a in enumerate(A):
        #print(i,a)
        if (i+1) % 2 != 0 and a % 2 != 0:
            ans += 1

    print(ans)

def main():

    N = LI()
    A = LI()

    solver(N,A)

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

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

print(num)
a=int(input())
b=list(map(int,input().split()))
ans=0
for i in  range(0,a,2):
  if b[i]%2==1:
    ans+=1
print(ans)
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

def main():
	N = inputInt()
	A = inputList()

	ans = 0
	for i,val in enumerate(A):
		ii = i+1
		if ii % 2 == 1:
			if val % 2 == 1:
				ans += 1

	print(ans)

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

ans = 0
for i, v in enumerate(arr):
  if (i+1) % 2 == 1 and v % 2 == 1:
    ans += 1

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

cnt = 0

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

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

result = 0
for i in range(0, N, 2):
    result += A[i]%2==1
print(result)
N = int(input())
a = list(map(int, input().split()))
i = 0
count = 0
for i,ai in enumerate(a):
    if((i+1)%2==1)and(ai%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:
        ans += 1
print(ans)
a=int(input())
li = list(map(int, input().split()))
count=0
for i in range(a):
  if(((i+1)%2==1) and (li[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+1)%2 == 1 and a[i]%2 == 1:
        ans += 1
print(ans)
n = int(input())
a = input().split()

answer =0
for i,v in enumerate(a):
    if i%2==0 and int(v)%2==1:
        answer+=1
print(answer)
N = int(input())
*a, = map(int, input().split())

ans = 0
for i in range(N):
    if (i+1)%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 (i+1) % 2 == 1 and a[i] % 2 == 1:
    count += 1
    
print(count)
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math

rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')

def main():
	n = int(rl())
	ans = 0
	for i, a in enumerate(rli(), 1):
		if i % 2 == 1 and a % 2 == 1:
			ans += 1
	print(ans)
	stdout.close()

if __name__ == "__main__":
	main()
n = int(input())

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

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

print(ans)
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
    if (i+1)&1 and A[i]&1:
        ans += 1
print(ans)
mass=int(input())
number=list(map(int,input().split()))

cnt = 0

for i in range(mass):
    if (i+1)%2!=0 and number[i]%2!=0:
        cnt+=1

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

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

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

import sys

def main():
    input = sys.stdin.readline
    n = int(input())
    a_list = list(map(int, input().split()))

    result = 0
    for i, a in enumerate(a_list):
        if i % 2 == 0:
            if  not a % 2 == 0:
                result += 1
        else:
            continue

    print(result)

    return


if __name__ == '__main__':
    main()
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()
n = int(input())
a = map(int, input().split())
ans = 0
for i, v in enumerate(a):
    if i%2 == 0 and v%2 == 1:
        ans += 1

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