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 copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))


N = int(input())
a = LI()


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()))
cnt = 0
for i in range(len(a)):
  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()))
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, = map(int, input().split())
print(sum(i%2 for i in a[::2]))

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

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

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

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

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

print(res)

Solution (Python):

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

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

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

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

count = 0

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

print(count)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=[i&1 for i in a[::2]]
print(sum(b))

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

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

count = 0

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

Solution (Python):
def main():
    N = int(input())
    A = [int(x) for x in input().split()]
    cnt = 0
    for i in range(N):
        if i % 2 == 0 and A[i] % 2 == 1:
            cnt += 1
    print(cnt)
 
if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
  if ((i+1)*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):
    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())
i = list(map(int, input().split())) 

s = 0

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

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy
n = int(input())


a = list(map(int, sys.stdin.readline().split()))

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

print(ans)

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

print(s)

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):
masu = int(input())
numberlist = list(map(int,input().split()))
counter = 0

for i in range(masu):
    if (i + 1) % 2 != 0 and numberlist[i] % 2 != 0:
        counter += 1
print(counter)

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

ans = []

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

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

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

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

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

ans = 0
for i,a in enumerate(A):
    if (i+1)%2 != 0 and a%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):
def main():
    input()
    array = [int(x) for x in input().split()]
    ans = sum(x % 2 == 1 for x in array[::2])
    print(ans)


if __name__ == '__main__':
    main()

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())
a = list(map(int, input().split()))
cnt = 0

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

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

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

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

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

print(sum(i%2 for i in a[::2]))

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

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

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

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=[int(x) for x in input().rstrip().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 = list(map(int, input().split()))

ans = 0

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

print(ans)

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

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

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


import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
INF = float("inf")

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

if __name__ == "__main__":
    main()

Solution (Python):








N = int(input())
A = map(int, input().split())
print(sum(((i + 1) * a) % 2 for i, a in enumerate(A)))

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

Solution (Python):
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math

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

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

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

if __name__ == "__main__":
	main()

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

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

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

for i in range(N):
	c += i%2==0 and a[i]%2
print(c)

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

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

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

print(ans)

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

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

print(counter)

Solution (Python):
n = input()
ans = 0
for i,j in enumerate(map(int,input().split())):
    ans += (~i&1 and j&1)
print(ans)

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

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

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

Solution (Python):
n=input()
print(sum(i&1 for i in list(map(int, input().split()))[::2]))

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

ans=0

for i in range(N):
    if i%2==1:
        continue

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

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

ans=0

for a in ai[::2]:
    if a%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):
  idx = i+1
  if a%2 == 1 and idx%2 == 1:
    ans += 1
print(ans)

Solution (Python):
kosuu = input()
lis = [int(i) for i in input().split()]
count=0

for i in range(1,len(lis)+1):
    if i%2 ==1:
        if lis[i-1] %2 ==1:
            count +=1
print(count)

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, a in enumerate(A):
    if (i+1)%2==1 and a%2==1:
        count += 1
print(count)

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

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

print(p)

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

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

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

print(count)

Solution (Python):
import sys
n = int(sys.stdin.readline().rstrip("\n"))
a = [int(s) for s in sys.stdin.readline().rstrip("\n").split()]
i = 0
s = 0
while i < n:
    if a[i] % 2 == 1:
        s += 1
    i += 2
print(s)

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

Solution (Python):
n = int(input())
ans = 0
for i, a in enumerate(map(int, input().split()), 1):
    if i % 2 == 0:
        continue
    if a % 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==0:
        if A[i]%2!=0:
            ans += 1
print(ans)

Solution (Python):
import numpy as np

N = int(input())
A = np.array(list(map(int, input().split())))
A_odd = A[::2]
print(np.sum(A_odd % 2))

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

cnt = 0
for a in input().split(' ')[::2]:
    if int(a) % 2 == 1:
        cnt += 1

print(cnt)

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

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

Solution (Python):
N=int(input())
li=list(map(int,input().split()))
cnt=0
for i in range(N):

  if li[i]%2!=0 and i%2==0:
    cnt+=1
    
print(cnt)

Solution (Python):
N, *a = map(int, open(0).read().split())

print(sum(e % 2 for e in a[::2]))

Solution (Python):
n = int(input())
s = list(map(int, input().split()))
a = 0
for j in range(n):
    if (j + 1) * int(s[j]) % 2 != 0:
        a += 1

print(a)

Solution (Python):
N, *a = map(int, open(0).read().split())

print(sum(1 for e in a[::2] if e % 2 == 1))

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

assert(len(a) == n)

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

Solution (Python):



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

if __name__ == '__main__':
    main()

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

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

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

ans = 0

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

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

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

print(count)

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

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

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

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

Solution (Python):
import sys

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


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


if __name__ == '__main__':
    solve()

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

print(sum([i&1 and a&1 for i,a in enumerate(A,1)]))

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):
_, *a = map(int, open(0).read().split())
print(sum(b%2 for b in a[::2]))

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

def main():
    _, *A = map(int, open(0).read().split())
    print(sum(i % 2 for i in A[::2]))


if __name__ == "__main__":
    main()

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

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())
nums = list(map(int, input().split()))

cnt = 0

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

print(cnt)

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

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

vec = [int(x) for x in input().split()]

cont = 0
for i in range(n):
    if (i+1)%2 != 0:
        if vec[i]%2 != 0:
            cont += 1;
        
print(cont)

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

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


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

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

print(ans)

Solution (Python):
import sys

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

n = int(readline())

a_list = list([int(x) for x in readline().rstrip().split()])

count = 0
for i in a_list[::2]:
    
    if i % 2 != 0:
        count += 1

print(count)

Solution (Python):
N = input()
A = list(map(int,input().strip().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()))
print(sum([i % 2 == 1 for i in a[::2]]))

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

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

Solution (Python):


import sys
input=sys.stdin.readline

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

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

for a in a_list[::2]:
  if a & 1:
    count += 1
print(count)

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

Solution (Python):
import sys


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


if __name__ == "__main__":
    main()

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

masu = [int(i) for i in input().split(' ')]

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

Solution (Python):
print(sum(map(lambda x:int(x)%2,open(0).read().split()[1::2])))

Solution (Python):
_,*A=map(int,open(0).read().split());print(sum([i%2for i in A[::2]]))

Solution (Python):
_,*A = map(int,open(0).read().split());print(sum([i%2for i in A[::2]]))

Solution (Python):
N,*A=map(int,open(0).read().split());print(len([i for i in A[::2]if i%2]))

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):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")


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, a in enumerate(a):
    if (i+1) % 2 == 1:
        if a % 2 == 1:
            count += 1
print(count)

Solution (Python):
n = int(input())
a = [int(i) for i in 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 n in range(N):
    if (n+1)%2 == 1 :
        if A[n]%2 == 1 :
            c = c + 1

print(c)

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

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

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

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

print(ans)

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

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

print(count)

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

print(b)

Solution (Python):
print(sum(int(i)%2for i in[*open(0)][1].split()[::2]))

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):
print(sum(int(i)%2for i in[*open(0)][1].split()[::2]))

Solution (Python):
print(sum(i%2for i in map(int,[*open(0)][1].split()[::2])))

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

Solution (Python):
import sys
import math



input = sys.stdin.readline
 

def inp():
    return(int(input()))
def inara():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))



n=inp()
ara=inara()
ans=0

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

print(ans)

Solution (Python):
import sys

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

N = I()
a = LI()

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

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect

def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


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 LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    n = I()
    a = LI()
    count = 0
    for i in range(1,n+1):
        if i % 2 != 0 and a[i-1] % 2 != 0:
            count += 1
    print(count)
    return


if __name__ == "__main__":
    solve()

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

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

Solution (Python):

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


if __name__ == '__main__':
    main()

Solution (Python):
input()
print(sum([*map(lambda x: int(x)%2, input().split())][::2]))