peterverebics/CodeNet_Python_118 huggingface dataset:
import sys
import math
import statistics
import itertools
from collections import deque

n=int(input())
#l,r,d=map(int,input().split())
lis=list(map(int,input().split()))
ans=0
for i in range(n):
    if i%2==1 and lis[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 and a[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 and A[i]%2 == 1:
        ans += 1
print(ans)
N = int(input())
a = list(map(int, input().split()))
b = [(i * ai) % 2 for i, ai in enumerate(a)]
print(sum(b))
N = int(input())
arr = list(map(int, input().split()))
count = 0
for i in range(N):
  if (i%2 == 1) and (arr[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 == 0:
    ans += 1
print(ans)
N = int(input())
L = list(map(int, input().split()))
ans = 0
for i, l in enumerate(L):
  if i % 2 == 1 and l % 2 == 1:
    ans += 1
print(ans)
n = int(input())
a = list(map(int,input().split()))

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

print(cnt)
N = int(input())

ans = 0

Line = [int(s) for s in input().split()]

for i,x in enumerate(Line):
    if i % 2 == 1:
        # print(x)
        if x % 2 == 1:
            ans += 1

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

c = 0
for i in range(n):
  if i % 2 == 1 and lst[i] % 2 == 1:
    c += 1
print(c)
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)
def main():
    n = int(input())
    A=[int(i) for i in input().split()]
    res = 0
    for i in range(1,n,2):
        if(A[i]%2==1):
            res+=1
    print(res)

if __name__ == '__main__':
    main()
# -*- 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 == 1:
        num += 1

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

c=0

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

ans=0
for i in x[1::2]:
    if i%2==1:
        ans+=1
N = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(1,N):
    if i % 2 != 0 and a[i] % 2 != 0:
        count += 1
    else:
        pass
    
print(count)
N = int(input())
an = map(int, input().split(" "))
ans = 0
for i, ai in enumerate(an):
    print(i+1, ai)
    if (i+1) % 2 == 1 and ai % 2 == 1:
        ans += 1
print(ans)
N = int(input())
a = []
a = input().split()

count = 0

for i in range(int(N/2)):
  cd = 2 * i - 1
  jd = int(a[cd])
  if jd % 2 == 1:
    count += 1
    

print(count)
n=input()
x=list(map(int,input().split()))
ans=0
for i in x[1::2]:
    if i%2==1:
        ans+=1
print(ans)
a=int(input())
li = list(map(int, input().split()))
count=0
for i in range(a):
  if((i%2==1) and (li[i]%2==1)):
    count+=1
print(count)
#!/usr/bin/env python3
import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate

sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7

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()
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 % 2 != 0):
            count += 1
    return count

print(oddProblem(l))
#! python3
# coding:utf-8

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

cnt=0

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

print(cnt)
import sys

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

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

print(count)
N = int(input())
A = list(map(int, input().split()))
count = 0
for i in range(1,N+1):
  if i %2 != 0:
    if A[i-1] != 0:
      count +=1
print(count)
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)
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(input())
a_list = list(map(int, input().split()))
count = 0
for i in range(1, n, 2):
    if a_list[i] % 2 == 1:
        count += 1
print(count)
N = int(input())
AAA = [int(i) for i in input().split()]

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

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

counter = 0

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

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

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

cnt=0
for i in range(len(a)):
    if (i+1)&1==a[i]==1:
        cnt+=1
print(cnt)
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:
        cnt+=1

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

c=0

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

ans = 0
for i in range(n):
  if i%2==1 and (a[i]+1)%2==1:
    ans += 1
    
print(ans)
n = int(input())
z = input().split()
odd = 0
for i in range(n):
    if i % 2 == 1:
        if int(z[i]) % 2 == 1:
            odd += 1
print(odd)
def main():
    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)

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

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

print(c)
#Problem B
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:
        cnt += 1
        
print(cnt)
n = int(input())
lst = list(map(int, input().split()))

c = 0
for i in range(n):
  if i % 2 == 1:
    if lst[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 (i%2==1)&(a[i]%2==1):
        count+=1
print(count)
N = int(input()) #1行目のNを取得する
A = list(map(int,input().split())) 

result = 0

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

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

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

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

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

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

c=0

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

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

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

print(cns)
N = int(input())
a = list(map(int, input().split()))
p = 0
for i in range(0, N):
    if i % 2 == 1 and a[i] % 2 == 0:
        p = p + 1
    else:
        p = p
print (p)
import sys
input = sys.stdin.readline
#N, K = (int(i) for i in input().split())
#B = [int(x) for x in input().split()]
#A = [[int(i) for i in input().split()] for i in range(N)]
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)
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
  if i%2==1 and a[i]%2==1: c+=1
print(c)
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()))
ans=0
for i in range(n):
  if i%2==1 and a[i-1]%2==1:
    ans+=1
print(ans)
N = int(input())
Mylist = input().split()
Mylist = [int(s) for s in Mylist]
ANS = 0
for i in range(N):
  if i+1 % 2 == 1 and Mylist[i] % 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 == 1:
    r += 1
    
print(r)
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==1 and item%2==1:
            c+=1
    print(c)
    exit()
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 = count + 1
print(count)
n=int(input())
A=list(map(int,input().split()))
cnt=0
for i in range(n):
  if A[i]%2!=i%2:
    cnt+=1
print(cnt)
n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(n, 1):
  if i%2 != 0:
    cnt += 1
    
print(cnt)
N = int(input())
A_i = input().split(" ")

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


print(count)
import sys
input = sys.stdin.readline


def read():
    N = int(input().strip())
    A = list(map(int, input().strip().split()))
    return N, A


def solve(N, A):
    ans = 0
    for i in range(N):
        if i % 2 == 1 and A[i] % 2 == 1:
            ans += 1
    return ans


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))
n=int(input())
A=[int(i) for i in input().split()]
ans=0
for i,a in enumerate(A):
    if i%2==1 and a%2==1:
        ans+=1
print(ans)
import sys
sys.setrecursionlimit(10**6)


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


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

count = 0

for i in range(int(N/2)):
  cd = 2 * i
  jd = int(a[cd])
  if jd % 2 == 1:
    count += 1

print(count)
n=int(input())
l=[0]
c=0
l.append(map(int,input().split()))
try:
  for i in range(1,n+1,2):
    if l[i]&1:
      c+=1
except:
  pass
print(c)
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    N=ii()
    A=list(mi())

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




if __name__ == "__main__":
    main()
N = int(input())
a = [int(e) for e in input().split()]

ans = 0
time = 0

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

print(ans)
#import numpy as np
#import math
#from decimal import *
#from numba import njit

#@njit
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)
    
main()
n = int(input())
l = list(map(int,input().split()))
m = []
for i in range(n):
  if i%2==0 and l[i]%2!=0:
    m.append(l[i])

print(m)
N = int(input())
lst = list(map(int, input().split()))

unko = 0
for i in range(len(lst)):
    if i % 2 == 1 and lst[i] % 2 == 1:
        unko += 1
print(unko)
#!/usr/bin/env python
"""エイシング プログラミング コンテスト 2020: B - An Odd Problem
https://atcoder.jp/contests/aising2020/tasks/aising2020_b
"""


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

    ans = 0
    for i in range(N):
        if i % 2 != 0 and As[i] % 2 != 0:
            ans += 1
    print('{}'.format(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):
        if(a[i]%2==1):
            count+=1
print(count)
N=int(input())
a=list(map(int,input().split()))
count=0
for i in range(N):
  if(i%2==1):
    if(a[i]%2==1):
      count+=1
print(count)
N, *A = map(int, open(0).read().split())
cnt = 0
for i in range(1, N, 2):
    if A[i] > 0 and A[i] % 2 == 1:
        cnt += 1
print(cnt)
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)
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n)[::2]:
    if a[i]%2 != 1:
        ans += 1

print(ans)
import sys
readline = sys.stdin.readline

def solve():
    N = int(readline())
    A = list(map(int, readline().split()))

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


solve()
a=int(input())
b=list(map(int,input().split()))
ans=0
for i in range(a):
    if i%2==1 and b[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)
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


INF = float('inf')

n = I()
a = LI()
ans = 0
for i, elem in enumerate(a):
    if i % 2 != 0 and elem % 2 != 0:
        ans += 1
print(ans)
n = int(input())
a = list(map(int, input().split()))

a = list(filter(lambda x: x % 2 == 1, a[1::2]))
print(len(a))
def main():
    N = int(input())
    A = [int(x) for x in input().split()]
    cnt = 0
    for i in range(N):
        if i % 2 == 1 and 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 != 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+1)%2!=0 and a_L[i] !=0:
        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):
        if i % 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())
count=0
A=list(map(int,input().split()))
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())
#N=15



input=input()
#input="13 76 46 15 50 98 93 77 31 43 84 90 6 24 14"
masu=[int(r) for r in input.split()]
ans=[]

for i in range(N):
  if masu[i]%2==1 and i%2==1:
    ans.append(i)

print(len(ans))
n = int(input())
cnt = 0
arr = [int(x) for x in input().split()]
for i in range(0, len(arr), 2):
    if arr[i] % 2 == 0:
        cnt += 1

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

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

counter = 0

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


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

for i in range (0, len(num)):
    if num[i] % 2 != 0 and i % 2 != 0:
        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())
As = map(lambda x: int(x), input().split(" "))

result = 0

for i, a in enumerate(As):
    index = i+1
    if a % 2 == 1 and i % 2 == 1:
        result += 1

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

ans = 0
for i in range(N):
  if i % 2 == 0 and (i+1)%2 == 0:
    ans += 1
    
print(ans)
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(count)
import numpy as np


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


N = int(input())
a = list(map(int, input().split()))
print(main(N, a))
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())
res=[0 for _ in range(10050)]
for x in range(1,45):
    for y in range(1,45):
        for z in range(1,45):
            k=x*x+y*y+z*z+x*y+y*z+z*x
            if k<10050:
                res[k]+=1
for i in range(N):
    print(res[i+1])
from sys import stdin
input = stdin.readline

N = input().rstrip()
a = [int(x) for x in input().split()]
ans = 0
for val in a:
    if a.index(val) % 2 != 0 and val % 2 != 0:
       ans = ans + 1
print(ans)
a = list(map(int,input().split()))
s = 0
for i in range(len(a))[::2]:
    if(a[i]%2==1):
        s = s + 1
print(s)
n=int(input())
count=0
a=list(map(int,input().split()))
for i in range(len(a)-1):
    if a[i-1]%2!=0 and i%2!=0:
        count+=1
print(count)
N = int(input())
a = list(map(int, input().split()))
#a = [list(map(int, list(input()))) for i in range(N + 1)]
# L, R, d = map(int, input().split())
cnt = 0
for i in range(0, N, 2):
    print(i)
    if a[i] % 2 != 0:
        cnt += 1
print(cnt)