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

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

print(count)

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

for num, idx in enumerate(cell):
    if idx == 0: continue
    if (num % 2 == 1) and (idx % 2 == 1):
        cnt += 1

print(cnt)

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

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

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

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

print(cnt)

Solution (Python):
i = int(input())
s = input()
l = s.split()
l_int = [int(n) for n in l]
tmp = 0
for j in range(i):
    if j % 2 ==0:
        if l_int[j] % 2 != 0:
            tmp += 1
print(tmp)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)

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

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 sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    n = int(input())
    A = [0] + list(map(int, input().split()))
    print(sum((i & 1) & (a & 1) for i, a in enumerate(A)))
resolve()

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
    else:
        pass

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 = list(map(int, input().split()))
print(len([a for a in A[::2] if a%2==1]))

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


count = 0

D = []
for i in range(N):
    if i % 2 == 0:
        D.append(i)



for j in D:
    if a[j] % 2 != 0:
        count += 1
        

print(count)

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

Solution (Python):
try:
    N = int(input())
    if N>=1 and N<=100:
        a = input().split()
        counter=0
        for i in range(0,len(a)):
            if (i+1)%2 != 0 and int(a[i])%2!=0:
                counter+=1
        print(counter)
except Exception as e:
    print(e)

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

Solution (Python):
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))



N = I()
a = LI()

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

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


print(count)

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

Solution (Python):
N = int(input())
a = list(map(int,input().split()))
l = list(range( 1 , N + 1))

c =[j for j in l if j % 2 != 0] 
b = [i for i in c if a[i-1] % 2 != 0] 

print(len(b))

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):
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):
input();print(sum(i%2 for i in map(int,input().split()[::2])))

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

Solution (Python):
def main():
    n = int(input())
    a = tuple([int(t)for t in 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 = list(map(int,input().split()))
c = 0

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

Solution (Python):
n = int(input())
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):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue

input = sys.stdin.readline

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]

def main():
	N = inputInt()
	A = inputList()

	ans = 0
	for i,val in enumerate(A):
		ii = i+1
		if ii % 2 == 1:
			if val % 2 == 1:
				ans += 1

	print(ans)

if __name__ == "__main__":
	main()

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

masu_list = []
for i in range(n):
    i=i+1
    if not i%2==0:
        masu_list.append(i)
    else:
        pass

answer_list=[]
for masu in masu_list:
    masu = masu-1
    answer_list.append(x[masu])

answer = [int(s) for s in answer_list]
answer_list_2=[]
for ans in answer:
    if not ans%2==0:
         answer_list_2.append(ans)
    else:
        pass
print(len(answer_list_2))

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):
_,*l=map(int,open(0).read().split());print(sum(-~e*i%2 for e,i in enumerate(l)))

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

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

print(ans)

Solution (Python):
n=int(input())
A=[-1]+list(map(int,input().split()))

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

print(ans)

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

Solution (Python):
i = int(input())
s = input()
l = s.split()
l_int = [int(n) for n in l]
tmp = 0
for j in range(i):
    if j % 2 ==0:
        
        if l_int[j] % 2 != 0:
            
            
            tmp += 1
print(tmp)

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

print(count)

Solution (Python):
n = int(input())
*A, = 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())
l = list(map(int, input().split()))

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

print(cnt)

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

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

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

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

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

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

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

print(cnt)

Solution (Python):
N = int(input())
a = [int(b) for b in input().split()]
for i in range(N):
  a[i] = a[i]%2
b = a[::2]
print(b.count(1))

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

num = 0

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

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

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

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

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

print(count)

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

print(cns)

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

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

data = data[0::2]

cnt = 0

for i in data:
  if i % 2 == 1:
    cnt += 1
    
print(cnt)

Solution (Python):
N, *A = map(int, open(0).read().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()))
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()))

result = 0

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

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

n = int(readline())
lst1 = list(map(int,readline().split()))
ans = 0
for i in range(0,n,2):
    if not even(lst1[i]):
        ans += 1
print(ans)

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

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

print(ans)

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

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




input=input()

masu=[int(r) for r in input.split()]
ans=[]

for i in range(1,N+1,2):

    if masu[i-1]%2==1:
        ans.append(i)

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

cnt = 0
for i, item in enumerate(a):
    if ((i + 1) % 2 == 1) and (int(item) % 2 == 1):
        cnt += 1

print(cnt)

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

count = 0

for idx, a_i in enumerate(list(map(int, input().split()))):
    
    if (idx + 1) % 2 != 0 and a_i % 2 != 0:
        count += 1

print(count)

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

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

Solution (Python):

N = int(input())
AAA = [int(i) for i in input().split()]

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

print(cnt)

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

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

Solution (Python):


import sys
sys.setrecursionlimit(300000)


def solve(N: int, a: "List[int]"):
    ret = 0
    for i, v in enumerate(a):
        if i % 2 == 0 and v % 2:
            ret += 1
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    a = [int(next(tokens)) for _ in range(N)]  
    solve(N, a)

if __name__ == '__main__':
    main()

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

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

count = 0
for a0 in a[::2]:
    a1 = int(a0)
    
    if a1 % 2 != 0:
        count += 1

print(count)

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

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
ans = list(map((lambda x: x%2 == 1), a[::2])).count(True)
print(ans)

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




def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))


def main():
	n=II()
	A=LI()

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

count = 0

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

print(count)

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

print(count)

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

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

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

ans = 0

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

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

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

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

Solution (Python):
def main():
    N = input_ints()

    a = input_int_list_in_line()

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




def input_ints():
    line_list = input().split()

    if len(line_list) == 1:
        return int(line_list[0])
    else:
        return map(int, line_list)


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


def input_int_tuple_list(n: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()

Solution (Python):



import sys


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


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


def main():
    N = int(input())
    a = list(get_ints())
    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())

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

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

print(k)

Solution (Python):
N = int(input())
a = [int(i) for i in input().split()]
b = a[0::2]
c = (N // 2) + (N % 2)
h = 0
for s in range(c) :
   if b[s] % 2 == 1:
      h += 1
print(h)

Solution (Python):
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
n=int(input())
a=get_array()
count=0
for i in range(1,n+1):
    if i&1==1 and a[i-1]&1==1:
        count=count+1
print(count)

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):
a = int(input())
s = 0
b = input().split(" ")
i = 1
while i <= a :
    if (i % 2 == 1) and (int(b[i-1]) % 2 == 1)  :
        s = s + 1
    i = i + 1
print(s)

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

a = [i for i in range(1,n+1)]

for a,b in zip(a,l):
    if not a%2==0 and not b%2==0:
        count = count + 1
        
print(count)

Solution (Python):
N = int(input())
an = map(int, input().split(" "))
ans = 0
for i, ai in enumerate(an):
    
    if (i+1) % 2 == 1 and ai % 2 == 1:
        ans += 1
print(ans)

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

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

Solution (Python):
a=int(input())
b=input().split(' ')
c=[]
d=0
e=0
while d<a:
    if (d+1)%2==1 and int(b[d])%2==1:
        e=e+1
    d=d+1
print(e)

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

c = []
for i in range(1,N+1):
    if i % 2 == 1 and a[i-1] % 2 == 1:
        c.append(i)
print(len(c))

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

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

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

print(L.count(1))

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))



def a_int(): return int(read())


def ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  
from functools import reduce

N = a_int()
A = ints()
ans=0
for a in A[::2]:
    ans += a & 1
print(ans)

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

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

resolve()

Solution (Python):
inpl = lambda: list(map(int,input().split()))
N = int(input())
A = inpl()
print(sum(A[i]%2 for i in range(0,N,2)))

Solution (Python):
from sys import stdin,stdout
n=int(stdin.readline().strip())
a=list(map(int,stdin.readline().strip().split()))
stdout.write(str(len([i for i,val in enumerate(a) if (i+1)%2==1 and val%2==1]))+"\n")

Solution (Python):
if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))

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

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

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

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy


if __name__ == "__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)

Solution (Python):
import numpy as np


def main():
    N = int(input().rstrip())
    a = np.array([int(i) for i in input().rstrip().split(' ')])

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

if __name__ == "__main__":
    main()

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

for k in range(N+1):
    if k % 2 == 0:
        continue
    else:
        if a[k-1] % 2 != 0:
            count += 1

print(count)

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
b = [((i + 1) * ai) % 2 for i, ai in enumerate(a)]
print(sum(b))

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

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

Solution (Python):
n = input()
lst = list(map(int, input().split()))
odd = 0
c = 0
for l in lst:
    odd += 1
    if odd % 2 == 1:
        if l % 2 == 1:
            c += 1

print(c)

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

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

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

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

print(count)

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

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

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

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

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
print(sum((idx + 1 & 1) and (num & 1) for idx, num in enumerate(a)))

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

ans = 0
count = 0
for i in a:
    count += 1
    if i % 2 == 1 and count % 2 == 1:
        ans += 1

print(ans)

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

Solution (Python):

N = int(input())
line = input().split(' ')

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

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

Solution (Python):
import numpy as np
N = int(input())
a = list(map(int, input().split()))

a = a[0::2]
a = np.array(a)


print(np.count_nonzero(a%2 != 0))

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

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

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




count = 0

for X in range(0,N,2):
 if int(a[X]) % 2 == 0:
   pass
 else:
   count = count +1

print(count)

Solution (Python):
for aa in range(2):
    a = list(map(int, input().split()))


ks = a[0::2]
    
c = 0
for b in ks:
    if b % 2 == 1:
        c += 1

print(c)

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

Solution (Python):
in_1 = input()
in_2 = input()

N = int(in_1)
a = in_2.split()

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

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

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

print(count)

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

Solution (Python):
total_number = int(input())
input_list = input().split(" ")
list_count = 0
answer_count = 0
for i in input_list:
	list_count += 1
	if list_count % 2 == 1:
		if int(i) % 2 == 1:
			answer_count += 1
print(answer_count)

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))

def resolve():
    N,=pin()
    A=lispin()

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

resolve()

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

Solution (Python):
num_masu = int(input())
masu_array = [int(x) for x in input().split()]

count = 0
for idx_masu in range(num_masu):
    if (idx_masu+1) % 2 == 1\
            and masu_array[idx_masu] % 2 == 1:
        count += 1

print(count)

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

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

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

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

print(cnt)

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    N = int(input())
    a = list(map(int, input().split()))
    ans = 0
    for i, ai in enumerate(a):
        if (i+1) % 2 == 1 and ai % 2 == 1:
            ans += 1
    print(ans)
if __name__ == "__main__":
    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())
num_lists = list(map(int, input().split()))

index_list = list(range(1, n+1, 1))
odd_list = []
for i in index_list:
    if i % 2 != 0:
        odd_list.append(i)

answer_lists = []
for i in odd_list:
    if num_lists[i-1] % 2 != 0:
        answer_lists.append(i)
print(len(answer_lists))

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

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

print(count)

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

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

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

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

ans=0

c=1
t1=0
t2=0

for i in inp:
    if c%2==1:
        t1=1
    if i%2==1:
        t2=1
    if t1==1 and t2==1:
        ans+=1
    
    t1=0
    t2=0
    c+=1

print(ans)