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

count = 0

for i in range(len(a_list)):

    # print("i : {0}".format(i))
    # print("a_list[i] : {0}".format(a_list[i]))

    if (i + 1) % 2 != 0 and a_list[i] % 2 != 0 :
        # print('OK!')
        count += 1

print(count)
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 = [int(_) for _ in 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_s= list(map(int, input().split(' ')))
count=0
for i in range(len(a_s)):
	if i%2==0:
		if a_s[i]%2==1:
			count+=1

print(count)
N = int(input())
a = list(map(int, input().split(' ')))
n = 0
for i in range(N):
    if (i+1)%2 != 0:
        if a[i]%2 != 0:
            n += 1
print(n)
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = 0

N = i()
a = l()

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()))
cnt = 0

for i in range(len(A)):
    if (i+1)%2 != 0 and A[i]%2 != 0:
        cnt += 1
        
print(cnt)
t= int(input())
lista=[int (x) for x in input().split()]
cont=0
for x in range(len(lista)):
    if x % 2==0:
        if lista[x] % 2 != 0:
            cont+=1
print(cont)
import sys

input = sys.stdin.readline


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

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

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

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

print(ans)
n = int(input())
A = [int(x) for x in input().split()]
comp = 0
for el in range(0, n, 2):
    if A[el] % 2 != 0:
        comp += 1

print(comp)
n = int(input())
li = list(map(int, input().split()))[:n]
count = 0
for i in range(0, n, 2):
    if li[i] % 2 != 0:
        count+=1
        
print(count)
from sys import stdin
N = int(stdin.readline())
num_line = stdin.readline()
nums = num_line.split(' ')
odd = True;
counter = 0
for i in nums:
    number = int(i)
    if (number%2 == 1 and odd):
        counter +=1 
    odd = not odd
    
print(counter)
N = int(input())

lst = input().split()

count = 0

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

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

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

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

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

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

  print(sum)

if __name__ == '__main__':
  main()
N = int(input())
input = input().split()
number = []
total = 0

for i in range(N):
  number.append(int(input[i]))
  if i % 2 == 0:
    if number[i] % 2 == 1:
      total += 1

print(total)
n = int(input())
a = list(map(int, input().split()))
odd_lst=a[0::2]
count=0
for i in odd_lst:
  if i%2 != 0:
    count+=1
print(count)
n = int(input())
a = list(map(int, input(). split()))

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

cnt = 0
for i, ai in enumerate(a):
    if (i + 1) % 2 == 1 and ai % 2 == 1:
        cnt += 1
print(cnt)
N = int(input())
nums = [int(i) for i in input().split()]

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

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

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

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

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools



sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

N = int(input())
a = [int(i) for i in input().split()]
ans = 0

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



print(ans)
# import sys
# readline = sys.stdin.readline
# generator = (readline().strip() for _ in range(N))

# N, M = map(int, input().split())
# As = list(map(int, input().split()))
# queries = (input() for _ in range(N))


def solve():
    N = int(input())
    As = list(map(int, input().split()))

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

        count += 1

    return count


def main():
    print(solve())


if __name__ == "__main__":
    main()
import math
import itertools
import collections
import bisect
import heapq

def IN(): return int(input())
def sIN(): return input()
def MAP(): return map(int,input().split())
def LMAP(): return list(map(int,input().split()))
def TATE(n): return [input() for i in range(n)]
MOD = 10**9 + 7

n = IN()
a = LMAP()
c = 0
ans = 0

for i in a:
  c += 1
  if i%2 == 1 and c%2 ==1:
    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) and (a[i] % 2 == 1):
        cnt += 1
print(cnt)
N = int(input())
n = list(map(int,input().split()))

ans = 0
for i in range(N):
  if n[i] % 2 == 1 and (i-1)%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 != 0:
    if a[i] % 2 != 0:
      ans += 1
print(ans)
#=input()
n=int(input())
#=map(int,input().split())
#=map(str,input().split())
l=list(map(int,input().split()))
k=l[::2]
j=list(filter(lambda x: x % 2 ==1, k))
print(len(j))
n=int(input())
l=[0]
c=0
l=l+(list(map(int,input().split())))

try:
  for i in range(1,n+1,2):
    if l[i]&1:
      c+=1
except:
  pass
print(c)
n = int(input())
A = tuple(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())
*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)
input()
ary = list(map(int, input().split()))
odd = 0
cnt = 0
while len(ary) > odd:
    if (ary[odd] % 2) != 0:
        cnt += 1
    odd += 2
print(cnt)
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 = map(int, input().split())
cnt = 0
for i, a in enumerate(A):
    if ((i + 1) * a) % 2:
        cnt += 1
print(cnt)
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)
n = int(input())
a = list(map(int, input().split()))

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

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

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

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

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

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

print(count)
def main():
    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)

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


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

print(cnt)
N=int(input())
lista=list(map(int,input().split()))
count=0
for i in range(0,N,2):
  if lista[i]%2==1:
    count=count+1
print(count)
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())
a = list(map(int,input().split()))
count = 0
for i in range(1,N+1):
    if i % 2 == 1 and a[i-1] % 2 == 1:
        count +=1
print(count)
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

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

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

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

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

print(k)
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


def resolve():
    readline = sys.stdin.readline

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

resolve()
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

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

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

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

print(ans)
def resolve():
  N = int(input())
  a = [int(x) for x in input().split(" ")]

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

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

cnt = 0

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

print(cnt)
# your code goes here
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)
# B

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

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

print(sum((i + 1) % 2 == 1 and a % 2 == 1 for i, a in enumerate(a_lst)))
def main():
        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)

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

nas = 0
for i in range(N):
  if i%2 == 0:
    if A[i]  %2 == 1:
      nas +=  1
print(nas)
N = int(input())
l = [int(x) for x in input().split()]
ans = 0 
for i in range(N):
    if (i+1) % 2 == 1 and l[i] % 2 == 1:
        ans += 1
print(ans)
N = int(input())
A = [int(X) for X in input().split()]
print(sum(True for T in range(1,N+1,2) if A[T-1]%2==1))
def main():
    N = int(input())
    A = [int(a) for a in input().split()]

    ans = 0
    for i in range(len(A)):
        if (i + 1) % 2 == 1 and A[i] % 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())
squares = list(map(int, input().split()))
count = 0
for i in range(N):
    if (i+1) % 2 and squares[i] % 2:
        count += 1
print(count)
n = int(input())
A = list(map(int, input().split()))
result = 0
for i in range(0, n, 2):
    if A[i] % 2 == 1:
        result += 1
print(result)
num_of_squares = int(input())
written_values = [i for i in input().split(" ")]
flag = 0
for i in range(num_of_squares):
    if ((i + 1) % 2 != 0) & (int(written_values[i]) % 2 != 0):
        flag += 1
print(flag)
input()
a = list(map(int, input().split()))

print(sum([ai % 2 for ai in a[::2]]))
N = int(input())
c = 0
for i, a in enumerate(map(int, input().split())):
    if i % 2 == 0 and a % 2 == 1:
        c += 1

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

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

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

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

odd = []
ans = []
for i in range(n):
  if i%2 == 0:
    odd.append(a[i])

for j in range(len(odd)):
  if odd[j]%2 == 1:
    ans.append(odd[j])

print(len(ans))
def 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)



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

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

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

res = 0
for v in a[::2]:
    if v % 2 == 1:
        res += 1

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

count = 0
a = a[::2]

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

print(count)
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)
i = int(input())
a = list(map(int, input().split()))

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

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

for a,b in zip(a,l):
    if not a%2==0 and not b%2==0:
        count = count + 1
        
print(count)
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

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

ans = 0

for i in range(0, N, 2):
    ans += 1 if A[i] & 1 else 0

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

for i in A:
  if num%2!=0:
    if i%2!=0:
      cnt += 1
  num += 1
print(cnt)
import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

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

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

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

print(ans)
N = int(input())
l = [ int(x) for x in input().split()]


def oddProblem(l):
    count = 0
    for i in range(N):
        if (l[i] % 2 != 0 and (i+1) % 2 != 0):
            count += 1
    return count

print(oddProblem(l))
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = list(map(int,readline().split()))
ans = 0
for i in range(N):
    if i % 2 ==0 and A[i] % 2 ==1:
        ans += 1
print(ans)
n = int(input())
lst = [int(x) for x in input().split()]

count = 0
for i in range(0, n, 2):
  if lst[i] % 2 == 1:
    count += 1
print(count)
def resolve():
    N = int(input())
    A = list(map(int,input().split()))
    count = 0
    for i in range(N):
        if i % 2 == 0 and A[i]%2==1:
            count+=1
    print(count)
resolve()
import sys
input = sys.stdin.readline
def main():
    N = int(input())
    a = list(map(int, input().split()))
    ans = 0
    for i, ai in enumerate(a):
        if (i+1) % 2 == 1 and ai % 2 == 1:
            ans += 1
    print(ans)
if __name__ == "__main__":
    main()
n=int(input(''))
a=list(map(int,input('').split(' ')))
s=0
for i in range(n):
    if (i+1)%2==1 and a[i]%2==1:
        s=s+1

print(s)
n=int(input())
A=list(map(int,input().split()))
cnt = 0
for i,a in enumerate(A):
  if (i+1)%2 == 1 and a%2 == 1:
    cnt+=1
print(cnt)
n=int(input())
a=list(map(int,input().split()))
ans=0
for i,x in enumerate(a):
    i+=1
    if (i*x)%2==0:
        continue
    ans+=1
print(ans)
# -*- coding: utf-8 -*-
import math

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

print(num)
# import sys
# input = sys.stdin.readline

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 == 0 and a[i] % 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!=0:
        ans+=1
        
print(ans)