Problem:
 Score : 200 points    Problem Statement We have N squares assigned the numbers 1,2,3,\ldots,N . Each square has an integer written on it, and the integer written on Square i is a_i .  How many squares i satisfy both of the following conditions?   The assigned number, i , is odd.  The written integer is odd.       Constraints  All values in input are integers.  1 \leq N, a_i \leq 100         Input Input is given from Standard Input in the following format:  N  a_1  a_2  \cdots  a_N       Output Print the number of squares that satisfy both of the conditions.        Sample Input 1 5
1 3 4 5 7      Sample Output 1 2   Two squares, Square 1 and 5 , satisfy both of the conditions.  For Square 2 and 4 , the assigned numbers are not odd.  For Square 3 , the written integer is not odd.        Sample Input 2 15
13 76 46 15 50 98 93 77 31 43 84 90 6 24 14      Sample Output 2 3

Solution (Python):
import sys


def resolve(in_):
    n = int(in_.readline())
    a = tuple(map(int, in_.readline().split()))
    return sum(1 for i, v in enumerate(a, 1) if i % 2 and v % 2)


def main():
    answer = resolve(sys.stdin.buffer)
    print(answer)


if __name__ == '__main__':
    main()

Solution (Python):
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)

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

Solution (Python):
def cin():
    return input().split()

n = int(input())
res = 0
x = cin()
l = len(x)
i = 0
while i < l:
    if (i + 1)%2!=0 and int(x[i])%2!=0:
        res += 1
    i += 1
print(res)

Solution (Python):
n = input()
N = int(n)
list = input().rstrip().split(" ")
nums = []
j = 0
for i in list:
    if j % 2 ==0:
        f = int(i)
        nums.append(f)
    j += 1
ans = 0
for k in nums:
    if k % 2 != 0:
        ans +=1
print(ans)

Solution (Python):
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)

Solution (Python):
import sys
import math

def input():
    return sys.stdin.readline().rstrip()


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





if __name__ == "__main__":
    main()

Solution (Python):
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)

Solution (Python):
N = int(input())

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

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

print(count)

Solution (Python):
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)

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

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

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

print(cnt)

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

Solution (Python):

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)

Solution (Python):
n,*aa = map(int, open(0).read().split())

print(sum([(i+1)%2 and v%2 for i,v in enumerate(aa)]))

Solution (Python):


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)

Solution (Python):
n = int(input())
nums = list(map(int, input().split()))

ans = 0
for i, num in enumerate(nums):
    if (i+1) % 2 != 0 and num % 2 != 0:
        ans += 1

print(ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
count=0

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

print(count)

Solution (Python):
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)

Solution (Python):


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

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

Solution (Python):
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)

Solution (Python):


import sys

def main():
    maps=[]
    n = int(input())
    count=0
    maps=list(map(int,input().split()))
    for idx,value in enumerate(maps,1):
        if idx % 2 != 0 and value %2 !=0:
            count+=1
    print(count)            

if __name__ == "__main__":
    main()

Solution (Python):

"""
@author: H_Hoshigi
"""
def main():
    N = int(input())
    A_lsit = list(map(int, input().split()))

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

if __name__ == "__main__":
    main()

Solution (Python):
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)

Solution (Python):
N = int(input())
a = [int(x) for x in input().split()]

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

print(cnt)

Solution (Python):
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)

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

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    N = i2n()
    a = i2nn()
    ans = 0
    for i in range(N):
        ans += bool((i + 1) % 2 and a[i] % 2)
    print(ans)
    return

main()

Solution (Python):
N = int(input())
li = list(map(int, input().split()))
ret = 0
for i, l in enumerate(li):
    if i % 2 == 0 and l % 2 == 1:
        ret = ret + 1
print(ret)

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
map_odd = a[::2]
print(len([i for i in map_odd if i % 2 == 1]))

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

Solution (Python):
n=int(input())
a=list(map(int, input().split())) 
ans = 0

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

print(ans)

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

ans = 0
for a_i, i in zip(a, range(len(a))):
    if ((i+1)%2==1) and ((a_i)%2==1):
        ans += 1
print(ans)

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

Solution (Python):
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)

Solution (Python):
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)

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

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
c = 0

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

print(c)

Solution (Python):
n = int(input())
s = list(map(int, input().split()))

cnt = 0
for i, x in enumerate(s):
    if (i + 1) % 2 == 1 and x % 2 == 1:
        cnt += 1
print(cnt)

Solution (Python):
N=int(input())
a = list(map(int, input().strip().split()))
counter=0
for i in range(N):
    if (i + 1) % 2 != 0 and a[i] % 2 != 0:
        counter += 1
print("{}".format(counter))

Solution (Python):
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)

Solution (Python):



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)

Solution (Python):
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)

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

ans = 0

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

print(ans)

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

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

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

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i, j  in enumerate(a):
    if (i+1)%2==0:
        continue
    elif (j%2)==0:
        continue
    else:
        ans+=1
print(ans)

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

Solution (Python):
n=int(input())
inp = list(map(int,input().split()))
sumi=0
for i in range(len(inp)):
  if (i+1)%2==1 and inp[i]%2==1:
    sumi+=1
print (sumi)

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

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

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

ans = [ ( ((n+1) * i % 2 ) == 1)*1 for n,i in enumerate(a)]
print( sum(ans ) )

Solution (Python):
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 = count+1
print(count)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
n = int(input())
masu = list(map(int, input().split()))
count = 0
for N in range(n):
  if ((N+1)*masu[N])%2 == 1:
    count += 1
print(count)

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

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):

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

icnt=0

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

Solution (Python):
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from copy import deepcopy

def main():
    n, *a = map(int, read().split())
    if n == 1:
        if a[0] % 2 == 1:
            print(1)
        else:
            print(0)
        sys.exit()
    r = 0
    for i1 in range(0,n,2):
        r += a[i1] % 2 == 1
    print(r)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
aList = list(map(int, input().split()))
count = 0
for i in range(n):
    if (i + 1) % 2 != 0 and aList[i] % 2 != 0:
        count += 1
print(count)

Solution (Python):
N = int(input())
a = map(int, input().split())

result = 0
for i, a_ in enumerate(a):
    i+=1
    if i%2!=0 and a_%2!= 0:
        result+=1
print(result)

Solution (Python):
n = int(input())
an = [int(a) for a in input().split()]

answer = 0
for i in range(0,len(an),2):
  if an[i]%2 == 1:
    answer += 1

print(answer)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
N = int(input())
lst = list(map(int,input().split()))

cnt = 0

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

print(cnt)

Solution (Python):
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)

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

Solution (Python):
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)

Solution (Python):
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 index % 2 == 1:
        result += 1

print(result)

Solution (Python):
def main():
    import sys
    def input(): return sys.stdin.readline().rstrip()
    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()

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):




def main():
    n = int(input().strip())
    a_list = list(map(int, input().split()))

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

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
arr = list(map(int, input().split()))
res = 0
for a in arr[::2]:
    if a % 2 == 1:
        res += 1
print(res)

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

Solution (Python):
N = int(input())
a_li = list(map(int,input().split()))
ans = 0
for idx,a in enumerate(a_li):
    if a % 2 == 1 and (idx+1) % 2 == 1:
        ans += 1
print(ans)

Solution (Python):
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)

Solution (Python):
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)

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

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

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):

N = int(input().strip())


A = [int(x) for x in input().strip().split(" ")]

cnt = 0

for i, v in enumerate(A):
    if i % 2 != 0:
        continue
    if v % 2 == 0:
        continue
    cnt += 1

print(cnt)

Solution (Python):
n = int(input())
masu = list(map(int, input().split(' ')))

masu_odd = masu[::2]
masu_odd_len = len(masu_odd)

ans=0
for i in range(masu_odd_len):
  if masu_odd[i]%2==1:
    ans+=1
    
print(ans)

Solution (Python):
n = int(input())
a = [ int(x) for x in input().split() ] 
c = 0

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

print(c)

Solution (Python):
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)

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

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

print(ans)

Solution (Python):
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)

Solution (Python):
n = int(input())
ass = list(map(int, input().split()))

cnt=0
for i, masu in enumerate(ass):
  if (masu%2 == 1)&((i+1)%2 == 1):
    cnt+=1
print(cnt)

Solution (Python):
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)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
ans = 0
for i , k in enumerate(a):
  if (i + 1) % 2 == 1 and k % 2 == 1:
    ans += 1
print(ans)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
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(cnt)

Solution (Python):
n=int(input())
ar=list(map(int,input().split()))
ans=0
for i in range(n):
    ans+=(((i+1)%2)&(ar[i]%2))
print(ans)

Solution (Python):
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)

Solution (Python):
n = int(input())
cnt = 0
L = list(map(int,input().split()))
for i in range(1,n+1):
    
    if i%2 ==1:
        if L[i-1]%2 == 1:
            cnt += 1

print(cnt)

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

for i in a:
    if i % 2 == 1:
        ans += 1
        
print(ans)

Solution (Python):
if __name__ == "__main__":
    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)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache





MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b: a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





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

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

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

print( ans )

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

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

Solution (Python):
n = int(input())

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

flg=0
for i in range(1,n+1):
    if i % 2 != 0 and a[i-1] % 2 != 0:
        flg+=1
print(flg)

Solution (Python):
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)

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

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

Solution (Python):

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
    else:
        pass
print(ans)

Solution (Python):



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


if __name__ == "__main__":
    main()

Solution (Python):


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

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
odd = [v for i, v in enumerate(A) if (i + 1) % 2 == 1 and v % 2 == 1]
print(len(odd))

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

Solution (Python):
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)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
ans = 0

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

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
cnt = 1
res = 0
for i in A:
  if cnt % 2 != 0 and i % 2 != 0:
    res += 1
  cnt += 1
print(res)

Solution (Python):
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)

Solution (Python):
import sys


def _i(): return int(sys.stdin.readline().strip())


def _ia(): return map(int, sys.stdin.readline().strip().split())


def main():
    n = _i()
    cnt = 0
    for i, ai in enumerate(_ia()):
        if i % 2 == 1:
            continue
        cnt += (ai % 2)
    return cnt


if __name__ == "__main__":
    print(main())

Solution (Python):
N = int(input())
print(len([1 for i, a in enumerate(input().split()) if i % 2 == 0 and int(a) % 2]))

Solution (Python):
import sys
import numpy as np

readline = sys.stdin.readline
read = sys.stdin.read

n = int(input())
a = np.array(readline().split(), dtype=np.int64)
a = a[::2]
ans = np.count_nonzero(a%2==1)
print(ans)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
ans = 0
for i, j in enumerate(a):
    if i%2==0 and j%2:
        ans+=1
print(ans)

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
s=0
k=1
while k<=n:
  if l[k-1]%2==1: s+=1
  k+=2
print(s)

Solution (Python):
import sys

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

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

cnt = 0

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

print(cnt)

Solution (Python):
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)

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

Solution (Python):
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)

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

    i += 1
print(ans)

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

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

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

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
i = 1
ans = 0
while i <= N:
    if A[i-1]%2==1:
        ans+=1
    i+=2
print(ans)

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

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

Solution (Python):
n = int(input())

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

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

Solution (Python):
from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

N = int(input())
Als = inpl()

count= 0
for i,item in enumerate(Als):
    if (i%2 == 0) and (item % 2 != 0):
        count += 1
print(count)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

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)

Solution (Python):
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)

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

Solution (Python):
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)

Solution (Python):
n=input()
print(len([a for a in list(map(int,input().split()))[::2] if a%2]))

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

Solution (Python):
import sys
input = sys.stdin.readline

'''

'''
def solve(n, arr):
    count = 0
    for i, ai in enumerate(arr, start=1):
        if i % 2 == 1 and ai % 2 == 1:
            count += 1
    return count

n = int(input())
arr = list(map(int, input().split()))
print(solve(n, arr))

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
n = int(input())
alist = list(map(int,input().split()))

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

Solution (Python):
n=int(input())
a=[int(x) for x in input().split()]
cnt=0
for i in range(n):
    if (i+1)%2==1 and a[i]%2==1:
        cnt+=1

print(cnt)

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

print(sum(1 for i in range(0, N, 2) if a[i] % 2 == 1))

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

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=0
for num , i  in enumerate(a,1):
    if num%2==1 and i%2==1:
        ans+=1
print(ans)

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