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):


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

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

print(ret)

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

c = [0] + c
ans = 0

for i in range(1,n+1):
    if i%2 == 1 and c[i]%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().strip().split()))

out = 0

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

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

Solution (Python):
import sys
N=int(sys.stdin.readline().strip())
A=map(int, sys.stdin.readline().split())
ans=0
for i,a in enumerate(A):
    if i%2==1: continue
    if a%2==1: ans+=1
print ans

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

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

Solution (Python):
import math
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(math.ceil(n/2)):
  if a[i*2]%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=[int(i) for i in 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 = [int(i) for i in input().split()]

c = 0

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

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

c = range(1, a + 1)

for i in range(a):
    if c[i] % 2 == 1 and b[i] % 2 == 1:
        ans += 1
print(str(ans))

Solution (Python):
import itertools
import decimal
import math
import collections
import sys

import copy







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

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

    print(cnt)



resolve()

Solution (Python):
import sys
import copy
from collections import deque
import collections
stdin = sys.stdin

mod = 10**9+7

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

n = ni()
a = na()

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

print(cnt)

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

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+=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==1:
    ans+=1
print(ans)

Solution (Python):




import numpy as np

def int_mtx(N):
    x = []
    for _ in range(N):
        x.append(list(map(int,input().split())))
    return np.array(x)

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

ans = 0

for i in range(0,(N+1)//2):
    if a[2*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+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 num, i in enumerate(a):
    if (num + 1) % 2 == 1 and i % 2 == 1:
        ans += 1
print(ans)

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

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):
input()
a=map(int,input().split())
b=0
for i,x in enumerate(a):
 if (i+1)%2==1 and x%2==1:
  b+=1
print(b)

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

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

cnt = 0

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

print(cnt)

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

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


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    _ = readint()
    a = list(readnums())
    ans = 0
    for i, v in enumerate(a):
        if (i + 1) % 2 and v % 2:
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

print(c)

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

for i in range(n):
    if (i+1)%2 != 0:
        if a[i]%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 and a[i] % 2 == 1:
        count += 1
print(count)

Solution (Python):
input =raw_input

n = int(input())
As = map(int, input().split(" "))
out = 0

for i in range(n):
    j = i + 1
    if j %2 == 0:
        continue
    if As[i] %2 == 1:
        out += 1
print(out)

Solution (Python):
N = int(input())
r = 0
for i, v in enumerate(map(int, input().split())):
    if (i + 1) % 2 == 0:
        continue
    if v % 2 == 1:
        r += 1
print(r)

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

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

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

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

ans=0

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

print(ans)

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

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

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

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

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

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

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

Solution (Python):
def main():
    n = int(input())
    A = [int(e) for e in input().split()]

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

    print(ans)


if __name__ == '__main__':
    main()

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

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

Solution (Python):
def main():
    n = int(input())
    A = [int(x) for x in input().split()]
    cnt = 0
    for idx, a in enumerate(A):
        if idx % 2 == 0 and a % 2 != 0:
            cnt += 1
    print(cnt)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

print(cnt)

Solution (Python):

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

for i in range(1,n+1,1):

    if i%2==1 and a[i-1]%2==1:
        cnt+=1

print(cnt)

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

Solution (Python):


N = int(input())
a_list = map(int, input().split(" "))

result = 0
for idx, v in enumerate(a_list):
    if (idx+1) % 2 == 1 and v % 2 == 1:
        result += 1

print(result)

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

Solution (Python):
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+1) % 2 == 1:
        if A % 2 == 1:
            ans += 1
print(ans)

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

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

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 = count+1

print(count)

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

ans = 0
for a in A[0::2]:
    if a % 2:
        ans += 1

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

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

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

Solution (Python):

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

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

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):
import sys
readline = sys.stdin.buffer.readline
read = sys.stdin.buffer.read


N = int(readline())
A = list(map(int, read().rstrip().split()))
A = A[::2]
B = [a for a in A if a % 2 == 1]
print(len(B))

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

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

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

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

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

Solution (Python):
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    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)


if __name__ == '__main__':
    main()

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

Solution (Python):


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)

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


ans = []
for i in range(n):
    if i%2==0 and a[i]%2==1:
        ans.append(i)
print(len(ans))

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

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

Solution (Python):
import sys
import numpy as np


MODE = 1


DIMENSION = 2


INT_TYPE = 1

if not (MODE):
    with open("input.txt", "r") as f:
        s = f.read()
else:
    s = sys.stdin.read()

if DIMENSION == 0:
    if INT_TYPE == 1:
        s = int(s)
elif DIMENSION == 1:
    if INT_TYPE == 0:
        s = s.split()
    elif INT_TYPE == 1:
        s = [int(x) for x in s.split()]
elif DIMENSION == 2:
    if INT_TYPE == 0:
        s = [x.split() for x in s.splitlines()]
    elif INT_TYPE == 1:
        s = [[int(y) for y in x.split()] for x in s.splitlines()]

N = s[0][0]
a = s[1]

cnt = 0
for i in range(0, N, 2):
    if 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+1) % 2 == 1 & A[i] % 2 == 1:
    ans += 1
print(ans)

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

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

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

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

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

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

print(count)

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



if __name__ == '__main__':
    main()

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

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

Solution (Python):

import collections
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())


def main():
    N = I()
    Aarray = LI()
    cnt = 0
    for i in range(N):
        if i % 2 == 0 and Aarray[i] % 2 != 0:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    main()

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 != 0:
            cnt += 1
    else:
        continue    
print(cnt)

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


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

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

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

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

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


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

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


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

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

Solution (Python):

n, *a = map(int, open(0).read().split())
print(sum(a[i] % 2 > 0 for i in range(0, n, 2)))

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


resolve()

Solution (Python):
import math
from collections import defaultdict

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

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


ans=0
for ii in range(n):
  if (ii+1)%2==1 and a[ii]%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):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()
    a = LI()

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

if __name__ == '__main__':
    resolve()

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())
nums = [int(i) for i in input().split()]

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

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

def Main():
    n = I()
    a = list(IL())
    c = 0
    for rep in range(0,n,2):
        if a[rep]%2:
            c += 1
    print(c)
    return

if __name__=='__main__':
    Main()

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

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

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

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

Solution (Python):

printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7


def ddprint(x):
  if DBG:
    print(x)

n = inn()
a = inl()
sm = 0
for i in range(n):
    if i%2==0 and a[i]%2>0:
        sm += 1
print(sm)

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

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

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

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):
import sys

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

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

Solution (Python):
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007



def main():
	a = int(input())
	
	
	al = lin()
	c=0
	for i, v in enumerate(al):
		if i % 2 == 0 and v % 2 == 1:
			c+=1
	print(c)
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

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

Solution (Python):
import sys
input = sys.stdin.readline
def 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 != 0:
                ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
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(0, N, 2):
        if(a[i] % 2 == 1):
            ans += 1
    print(ans)


if __name__ == '__main__':
    main(sys.stdin.readline, print)

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

Solution (Python):

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

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]
count = 0
for i, a_i in enumerate(A):
    if (i + 1) % 2 == 1 and a_i % 2 == 1:
        count += 1

print(count)

Solution (Python):
n=int(input())
count=0
a = input().split(" ")
lista = [int(n) for n in a]
for i in range(0,n,2):
  if lista[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!=0:
    ans+=1
print(ans)

Solution (Python):
n = int(input())
array = [int(s) for s in input().split()]

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

Solution (Python):
N = int(input())
A = [int(X) for X in input().split()]
Count = 0
for T in range(0,N):
    if (T+1)%2==1 and A[T]%2==1:
        Count += 1
print(Count)

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

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

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

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

Solution (Python):
"""
NTC here
"""



import os
import sys
from io import BytesIO, IOBase

profile = 0
pypy = 1


def iin(): return int(input())


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



def main():
    T = 1
    while T:
        T -= 1
        n = iin()
        a = lin()
        ans = [1 for i in range(n) if a[i]%2 and i%2==0]
        print( sum(ans) if ans else 0)




    
        










    




                

        

 
 
 
 
 
 

 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
if pypy:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
    input = lambda: sys.stdin.readline().rstrip("\r\n")
 

 
if __name__ == "__main__":
    if profile:
        import cProfile
        cProfile.run('main()')
    else:
        main()