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 math

N = int(input())

ai = input().split(' ')

num = 0
for i in range(N):
    if i % 2 == 0:
        if int(ai[i]) % 2 == 1:
            
            
            num += 1

print(num)

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

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

for i in range(N):
    a1 = i % 2
    a2 = a[i] % 2
    if (a1==0 and a2==1):
        b.append(i)
print(len(b))

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

Solution (Python):
n=int(input())
l=[int(X) for X in input().split()]
c=0
for i in range(len(l)):
  if l[i]%2 !=0 and (i+1)%2!=0:
    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 == 1:
        ans += 1
print(ans)

Solution (Python):
import sys
import numpy as np
import math  
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 

def main():
    n = int(input())
    a = list(map(int,input().split()))
    
    ans_list = [a[i] for i in range(n) if i % 2 == 0]
    ans = [ans_list[i] for i in range(len(ans_list)) if ans_list[i] % 2 == 1]
    
    
    print(len(ans))
    return 0

if __name__ == "__main__":
    main()

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

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

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

mas_num = 1
satisfy_num = 0

for i in list:
  if (mas_num % 2) != 0:
    if  (i % 2) != 0:
      satisfy_num += 1
  mas_num += 1

print(satisfy_num)

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

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

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

print(count)

Solution (Python):
n = int(input())
arr = list(map(int,input().split()))
def odd(n) : return (n%2==1)
lst = list(filter(odd,arr[0:n:2]))
print(len(lst))

Solution (Python):



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

Ans = 0

for k, v in enumerate(anums):
  if k % 2 == 0:
    if v % 2 == 1:
      Ans += 1

print(Ans)

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

cnt = 0
for ai in an[::2]:
    if ai % 2 != 0:
        cnt+=1

print(cnt)

Solution (Python):
d = input("")
N = int(d)
d = input("")
list = d.split()
num = []

i = 0
j = 0
while i < N:
    if ( i + 1 ) % 2 == 1:
        num.append (list[i])
        j = j + 1
    i = i + 1

j = 0
len = len(num)
count = 0
while j < len:
    if int(num[j]) % 2 == 1:
        count = count + 1
    j = j + 1

print(count)

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

if n%2 == 0:
  for i in range(n//2):
    if (num_list[2*i]%2) == 1:
      count += 1
else:
  for i in range((n//2) + 1):
    if (num_list[2*i]%2) == 1:
      count += 1
      
print(count)

Solution (Python):
input()

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

b = 0
for i, n in enumerate(a):
  i += 1
  if i % 2 == 0 or n % 2 == 0:
    continue
  b += 1
print(b)

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

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

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

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

print(ans)

Solution (Python):
in_str = input()
N = int(in_str)
in_list = input().split(' ')
count = 0

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

print(count)

Solution (Python):
num_dic = {}
num_num = int(input())
odd_count = 0
input_line = input().split(" ")
for i in range(len(input_line)):
    num_dic[i+1] = int(input_line[i])
for k, v in num_dic.items():
    if int(k) % 2 == 1 and int(v) % 2 == 1:
        odd_count += 1
print(odd_count)

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

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

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

if(N%2 == 0):
  N = int(N/2)
else:
  N = int(N/2)+1
count = 0
for i in range(1,N+1):
  if(a[(2*i-1)-1]%2 == 1):
    count += 1
print(count)

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

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

a = L[0::2]


for x in a:
    if x%2==0:
        count=count
    else:
        count=count+1
print(count)

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

count = 0

for i in range(1, n+1):
    mod_n = i % 2
    if mod_n == 1:
        mod_masu = int(a[i-1]) % 2
        if mod_masu == 1:
            count += 1

print(count)

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
import itertools as it
import collections as cl
import math
from functools import reduce

def li():
    return [int(x) for x in input().split()]

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

Solution (Python):
a = int(input())
num = input().split()
num = [int(x) for x in num]
cnt = 0
for x in range ((a+1)//2):
  if num[0+2*x]%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:
    if a[i]%2==1:
      counter+=1
print(counter)

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

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

Solution (Python):
input()
a = input()
b = map(int,a.split())
c = 1
e = 0
for d in b:
	if c % 2 == 1:
		if d**2 % 2 == 1:
			e += 1
	c += 1
print(e)

Solution (Python):
a = int(input())
b = list(input().split())

count = 0

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

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

print(c)

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

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(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()))
b = a[0::2]
number = 0

for i in b:
  if i%2 != 0:
    number = number + 1
  else:
    pass
print(number)

Solution (Python):




import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
MOD = (10 ** 9) + 7  


def 関数(n, a):
    res = 0
    for i, num in enumerate(a):
        index = i + 1 
        index %= MOD
        if index % 2 and num % 2:
            res += 1
    return res

def çözmek():
    N = input()
    a = list(iimr())
    res = []
    res.append(関数(N,a))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()

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

print(ans)

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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



step = 2
for i, name in enumerate(a, 1):
    if i%2 == 1:
        if name%2 ==1:
            count += 1
        else:
            pass
    else:
        pass

print(count)

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())
l = [int(x) for x in input().split()]
ans = 0
for i in range(0, N, 2):
    if l[i] % 2 == 1:
        ans += 1
print(ans)

Solution (Python):
input()
ary = list(map(int, input().split()))
odd = 0
cnt = 0
while len(ary) > odd:
    if (ary[odd] % 2) != 0:
        cnt += 1
    odd += 2
print(cnt)

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

for i in range(1, n+1, 2):
    if ary[i-1] % 2 == 1:
        s += 1

print(s)

Solution (Python):
s1 = input()
s2 = input()

a = int(s1)
b = s2.split()

c = (a + 1) // 2;

cnt = 0;

for i in range(c):
    if int(b[2 * i]) % 2 == 1:
        cnt = cnt + 1


print(cnt)

Solution (Python):


a = int(input())

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

res = 0
for i in range(a):
    if (i+1) % 2 == 0:
        continue
    if b[i] % 2  == 1:
        res = res + 1
        
        
print("{}".format(res))

Solution (Python):




import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
MOD = (10 ** 9) + 7  


def 関数(n, a):
    res = 0
    for i, num in enumerate(a):
        index = i + 1 
        if index % 2 and num % 2:
            res += 1
    return res

def çözmek():
    N = input()
    a = list(iimr())
    res = []
    res.append(関数(N,a))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()

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

for masu in li:
  count += 1
  if count % 2 != 0:
    if masu % 2 != 0: 
    	final += 1
        
print(final)

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


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

ans = 0
for i in itertools.count(0, 2):
    if i > N - 1:
        break
    if A[i] % 2 == 1:
        ans += 1
print(ans)

Solution (Python):
import sys 

readline = sys.stdin.readline 

N = int(input())
A = readline().split()

counter = 0
for i in range(N):
    if (i+1) % 2 != 0:
        if int(A[i]) % 2 != 0:
            counter += 1

print(counter)

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

cnt = 0
for a in A[::2]:
    if a % 2 != 0:
        cnt += 1
print(cnt)

Solution (Python):
N = int(input())
input = input().split()
number = []
total = 0

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

print(total)

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

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]
index_count = 0
count = 0
t = 1
for i in A:
    if t % 2 !=0:
        if i % 2 != 0:
            count += 1
    t += 1
print(count)

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

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

cnt=0
ans_cnt=0
for i in a:
	cnt+=1
	if i%2==1 and cnt%2==1:
		ans_cnt+=1
        
print(ans_cnt)

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

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

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

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):
from sys import stdin,stdout
n=int(stdin.readline())
a=list(map(int,stdin.readline().split()));ans=0
for i in range(1,n+1):
    if i&1 and a[i-1]&1:ans+=1
print(ans)

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

Solution (Python):
a=int(input())
b=list(map(int, input().split())) 
kisuu=b[0::2]
ans=[num for num in kisuu if num % 2 == 1]
print(len(ans))

Solution (Python):
n = int(input())
a_list = [s for s in map(int, input().split())]
num = 0
for i in range(n):
    x = a_list[i] / 2
    y = (i + 1) / 2
    if x != int(x) and y != int(y):
        num += 1
print(num)

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

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

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

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


print(cnt)

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

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

if N % 2 ==0:
    for i in range((N+2)//2 - 1):
        if A[2*i ] % 2 == 1:
            count += 1
else:
    for i in range((N+2)//2):
        if A[2*i ] % 2 == 1:
            count += 1

print(count)

Solution (Python):
import sys

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

def solver(N,A):
    ans = 0

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

    print(ans)

def main():

    N = LI()
    A = LI()

    solver(N,A)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
nums = list(map(int,input().strip().split()))
i = 0
c = 0
while i<n:
  if (i+1)%2!=0 and nums[i]%2!=0:
    c += 1
  i += 1
 
print(c)

Solution (Python):
N = int(input())
a_list = list(map(int, input().split()))
q, r = divmod(N, 2)
n = q + r
count = 0

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

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

tmp = input().split(' ')

a = []
result = []
for i in range(N):
    a.append(int(tmp[i]))
    if ((i+1) % 2 == 1 and a[i] % 2 == 1):
        result.append(a[i])

print(len(result))

Solution (Python):

n=int(input())


l=list(map(int,input().split()))
k=l[::2]
j=list(filter(lambda x: x % 2 ==1, k))
print(len(j))

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

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

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

    if a % 2 == 0:
        continue

    ans += 1

print(ans)

Solution (Python):
N=int(input()) 
A=list(map(int,input().split(" "))) 
An=[i for i in range(1,N+1)] 

count=0 


for ai in range(len(A)):
    if (A[ai]%2==1) and (An[ai]%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 and a[i] % 2 == 1:
        cnt += 1

print(cnt)

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

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

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

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

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

if __name__ == "__main__":
    main()

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

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

print(ans)

Solution (Python):
N = int(input())
list = list(map(int, input().split()))
cnt = 0
li = []
for count, i in enumerate(list):
    if count %2 ==0:
        li.append(i)

for j in range(len(li)):
    if li[j] %2 ==1:
        cnt +=1
print(cnt)

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)

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

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

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




if __name__ == "__main__":
    main()

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

count = 0

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

print(count)

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

print(count)

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

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

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


ans = 0
for i in range(len(a_list)):
    no = i + 1
    value = a_list[i]
    
    if no % 2 == 1:
        if value % 2 == 1:
            ans += 1
print(ans)

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

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

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

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

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

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

for i in range(len(a)):
  if i%2 == 0:
    ans.append(a[i])
  else:
    continue

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

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

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

i = 0
j = 0
while i < n:
    if a[i] % 2 == 1:
        j += 1
    i = i +2

print(j)

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):
num=input()

masu=list(map(lambda x:int(x),input().split()))
masu=masu[0::2]
ans=[i for i in masu if i%2!=0]
print(len(ans))

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

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

print(count)

Solution (Python):
N=int(input())
A=list(map(int, input().split()))
B=0
count=0
if N%2!=0:
    N=N+1
for i in range(round(N/2)):
    if A[B]%2!=0:
        count=count+1
    B=B+2
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:
        if 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%2 == 0 and A[i]%2 != 0:
        cnt += 1
    else:
        continue
print(cnt)

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

if (N%2 == 0):
  c=N//2
else:
  c=N//2 + 1

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

print(b)

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

Solution (Python):

N = int(input()) 
masu_list = list(map(int, input().split()))
result = 0

for i, masu in enumerate(masu_list):
    i = i+1
    if i % 2 == 1:
        if masu % 2 == 1:
            result = result + 1

print(result)

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

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

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

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

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

A = A[::2]
A_odd = [i for i in A if i % 2 == 1]

print(len(A_odd))

Solution (Python):
n=int(input())
lst=list(map(int,input().split()))
cnt=0
for i,j in enumerate(lst,1):
    if i%2==0:
        pass
    else:
        if j%2==0:
            pass
        else:
            cnt+=1
print(cnt)

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

print(sum(a % 2 == 1 for i, a in enumerate(A, 1) if i % 2 == 1))

Solution (Python):
N = int(input())
A_i = input().split(" ")

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


print(count)

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

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

print(ans)

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

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

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

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

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

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

Solution (Python):
import math

def a():
    l,r,d = map(int,input().split())
    count = 0
    for i in range(l,r+1):
        if i % d == 0:
            count += 1
    print(count)


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


def c():
    print('')



def d():
    print('')


b()

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

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy


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

    print(ans)

if __name__ == '__main__':
	main()

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

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

print(count)

Solution (Python):
N = int(input())
Mylist = input().split()
Mylist = [int(s) for s in Mylist]
ANS = 0
for i in range(1,N+1):
  if i % 2 == 1 and Mylist[i-1] % 2 == 1:
    ANS += 1
print(ANS)

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


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


L_odd=L[::2]
j=0
for i in L_odd:
    
    if i%2==1:
        j+=1
print(j)

Solution (Python):

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

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

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

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

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

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

print(count)

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

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

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

if __name__ == "__main__":
  resolve()

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

Solution (Python):
def main():
  from sys import stdin
  n = int(stdin.readline())
  l = list(map(int, stdin.readline().split()))
  c = 1
  k = 0
  for a in l:
    if c == 1:
      if a % 2 == 1:
        k += 1
      c = 0
    else:
      c = 1
  print(k)
main()

Solution (Python):
N = int(input())
arr = tuple(map(int, input().split()))
count = 0

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

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

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