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

    print(total)
    

main()

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

print(count)

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

print(counter)

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

Solution (Python):
FAST_IO = 1
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()

    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
rrmm = lambda n: [rrm() for _ in xrange(n)]

n = rri()
arr = rrm()
ans = 0
for i in range(0, n,2):
    if arr[i]&1:
        ans+=1
print(ans)

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

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

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

ans = 0

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

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

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

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

Solution (Python):
N=int(input())
list = list(map(int, input().split()))
list.insert(0,0)
l=len(list)
i=1
r=0

while(i<l):
  if(i%2!=0):
    if(list[i]%2!=0):
      r+=1
  i+=1
print(r)

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

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

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

print(s)

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

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

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

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

Solution (Python):
import math
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):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def main():
    N, *A = map(int, read().split())
    ans = 0
    for a in A[::2]:
        if a % 2 == 1:
            ans += 1
    print(ans)
    return

if __name__ == '__main__':
    main()

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

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

print(cnt)

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

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

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

        ans+=1
print(ans)

Solution (Python):









import os
import sys




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):
""" B
    https://atcoder.jp/contests/aising2020/tasks/aising2020_b
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

def readString():
    return sys.stdin.readline()

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return reduce(lambda acc, _: acc + [readIntegerSet(m)], range(0, n), [])

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

if __name__ == "__main__":
    _N = readInteger()
    _a = readIntegerSet(_N)

    print(main(_N, _a))

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

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

result_sum = 0
for i, n in enumerate(a_list):
    i += 1  

    if i % 2 == 1 and n % 2 == 1:
        result_sum += 1 

print(result_sum)

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

cnt = 0

for i in range(n):
	if (i+1)&1 and l[i]&1:
		cnt+=1
print(cnt)

Solution (Python):

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

count = 0

for i in range(len(a_list)):

    
    

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

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

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

        if a_lst[i] % 2 != 0:
            count += 1

    print(count)


if __name__ == "__main__":
    main()

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

print(ans)

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

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

print(ans)

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

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

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

Solution (Python):
from __future__ import print_function
import sys


if sys.subversion[0] == "PyPy":
    import io, atexit

    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())


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




n = RN()
a = RA()
solve()

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

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
count = 0
for i, e in enumerate(a):
    number = i + 1
    if number % 2 != 0 and e % 2 != 0:
        count+=1

print(count)

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

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

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

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

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

memo = [0]*(N+1)

for i in range(1,N+1):
  if i % 2 == 1 and As[i] % 2 == 1:
    memo[i] = 1
  
print(sum(memo))

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

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

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

i=0
ans=0
while 2*i<n:
    if a[2*i]%2==1:
        ans+=1
    i+=1
print(ans)

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

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

print(result)

Solution (Python):
N = int(input())
line = [int(i) for i in input().split()]
oddLs = line[0::2]
cnt = 0
for num in oddLs:
    if num % 2 != 0:
        cnt += 1
print(cnt)

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


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

print(count)

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(500005)


def solve(N: int, a: "List[int]"):
    counter = 0
    for i in range(1,N+1):
        if ((i % 2 == 1) and (a[i-1] %2 == 1)):
            counter += 1
    
    print(counter)



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

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

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

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

    ans = 0

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

main()

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

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

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

c = 0
for i, a in zip(range(1, N+1), a_list):
    if i % 2 == a % 2 == 1:
        c += 1
print(c)

Solution (Python):
n=int(input())
*a,=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 getInts():
    return [ int(x) for x in input().split() ]

[N] = getInts()
a = getInts()

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

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

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

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

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

Solution (Python):
from sys import stdin

def main():
    n = int(input())
    a = [int(x) for x in stdin.readline().rstrip().split()]
    cnt = 0
    for i, aaa in enumerate(a):
        if (i + 1) % 2 and aaa % 2:
            cnt += 1
    print(cnt)
    

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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


print(cnt)

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

i = 0
cnt = 0
while(i < len(l)):
  if l[i] % 2 == 1:
    cnt += 1
  i += 2
print(cnt)

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

    print(cnt)

main()

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

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

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

print(ans)

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

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

print(ans)

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

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

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

ans = 0

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

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools



sys.setrecursionlimit(10**7)






N = int(input())
a = [int(i) for i in 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()))

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

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

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

    print(c)


if __name__ == "__main__":
    resolve()

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

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

if __name__=='__main__':
    n,a=readinput()
    ans=main(n,a)
    print(ans)

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

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

input_converted = []

try:
    for i in range(N // 2 + 1):
        input_converted.append(input_1[2*i])
except:
    pass

ans = 0

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

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

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



import sys


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


def resolve():
    n = int(input().rstrip())
    a_list = list(map(int, input().split()))

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

    print(cnt)



if __name__ == "__main__":
    resolve()

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

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

if __name__ == "__main__":
    main()

Solution (Python):

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

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

print(cou)

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

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

print(res)

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

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

print(len(list(filter(lambda x:x[0]%2 == 0 and x[1]%2 == 1, enumerate(A)))))

Solution (Python):
n,*l=map(int,open(0).read().split())
c=0
for e,i in enumerate(l):
  c+=((e+1)*i)%2
print(c)

Solution (Python):


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

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

    print(cnt)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = [int(_) for _ 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())
l = list(map(int, input().split()))

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

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

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

    count = 0

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



if __name__ == '__main__':
    main()

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

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

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

N = int(sys.stdin.readline())


ans = 0

for i,n in enumerate(map(int, sys.stdin.readline().split())):
    if i % 2 != 0:
        continue
    if n % 2 == 0:
        continue
    ans += 1


print(ans)

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

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

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

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

print(ans)

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

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

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

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

print(cnt)

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

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

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

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

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

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

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

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

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

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

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

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

main()

Solution (Python):
def main():
    n = int(input())
    a = list(map(int, input().split()))
    a = a[::2]
    ans = 0
    for aa in a:
        if aa%2 == 1:
            ans += 1
    print(ans)
    
if __name__ == '__main__':
    main()

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

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

print(res)

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

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

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

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

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):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

n = i()
a = intl()

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

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

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

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

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

Solution (Python):
def function(N, a):
    number = 0
    ans = 0
    while number < N:
        if number % 2 == 0:
            if a[number] % 2 == 1:
                ans += 1
        number += 1

    return ans


if __name__ == '__main__':
    N = int(input())
    a = input().split()
    a = [int(i) for i in a]
    print(function(N, a))

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

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

ans = 0

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

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

print(len([c for c in A[::2]if c%2==1]))

Solution (Python):
from sys import stdin
data = stdin.readlines()

n = int(data[0].split()[0])
a = [int(s) for s in data[1].split()]

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

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

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

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

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

for _ in range(0, n, 2):
  if asa[_]%2==1:
    ans+= 1
    
print(ans)

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

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

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

b= []
b = a[0::2]

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

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

for i in A:
  if num%2!=0:
    if i%2!=0:
      cnt += 1
  num += 1
print(cnt)

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

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

print(ans)

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

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

Solution (Python):
import sys
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
import math
import copy


MOD = 10 ** 9 + 7




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)