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



Sample input:
5
1 3 4 5 7


Sample output:
2

Submission status: Accepted

Solution code:
# @uthor : Kaleab Asfaw
from sys import stdin, stdout
# Fast IO
def input():
	a = stdin.readline()
	if a[-1] == "\n": a = a[:-1]
	return a
def print(*argv, end="\n", sep=" "):
	n = len(argv)
	for i in range(n):
		if i == n-1: stdout.write(str(argv[i]))
		else: stdout.write(str(argv[i]) + sep)
	stdout.write(end)
# Others
mod = 10**9+7
def lcm(x, y): return (x * y) / (gcd(x, y))
def comb(lst, x):
	from itertools import combination as c
	return list(comb(lst, x))
def fact(x, mod=mod):
	ans = 1
	for i in range(1, x+1): ans = (ans * i) % mod
	return ans
def arr2D(n, m, default=0):
	lst = []
	for i in range(n): temp = [default] * m; lst.append(temp)
	return lst
def sortDictV(x): return {k: v for k, v in sorted(x.items(), key = lambda item : item[1])}
def smaller(lst, x): return bisect_left(lst, x) -1
def smallerEq(lst, x): return bisect_right(lst, x) -1

def solve(n, lst):
	cnt = 0
	for i in range(n):
		if i % 2 == 0 and lst[i] % 2:
			cnt += 1
	return cnt

n = int(input())
lst = list(map(int, input().split()))
print(solve(n, lst))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    n = int(input())
    A = list(map(int,input().split()))
    cunt=0
    for i, a in enumerate(A):
        if i%2==0 and a%2:
            cunt+=1
    print(cunt)


if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
# エイシング プログラミング コンテスト 2020: B – An Odd Problem
N = int(input())
a = [int(i) for i in input().split()]

num_odd = 0

for idx in range(1, N + 1, 2):
    if a[idx -1] % 2 == 1:
        num_odd += 1

print(num_odd)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input()

result = 0
for i, x in enumerate([int(a) for a in input().split()]):
  result += (i+1) & 1 and x & 1
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

count=0

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

Submission status: Accepted

Solution code:
n=int(input())
c=list(map(int,input().split()))
count=0
for i in range(len(c)):
  count+=((i+1)*(c[i]))&1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, *A = map(int, open(0).read().split())

print(len([a for a in A[::2] if a%2]))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

N = int(input())
As = list(mapint())
ans = 0
for i, a in enumerate(As, 1):
    if i%2==1 and a%2==1:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
n, *a = map(int, open(0).read().split())
print(len([i for i, v in enumerate(a) if -~i & v & 1]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

print(ans)

Submission status: Accepted

Solution code:
X = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(0,X,2):
    if A[i]%2!=0:
        ans+=1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = list([int(x) for x in input().split()])

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
s=list(map(int,input().split()))
count=0


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

print(count)

Submission status: Accepted

Solution code:
N = int(input())
mass = list(map(int, input().split()))
odd_list = []
count = 0
for i in range(0, len(mass), 2):
  odd_list.append(mass[i])
for k in odd_list:
  if k % 2 != 0:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
N = int(n)

list1 = input().split(" ")
Numbers = list1[:N]

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

Submission status: Accepted

Solution code:
N = int(input())

lst = input().split()

count = 0

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

print(count)

Submission status: Accepted

Solution code:
n = int(input())
A = [int(x) for x in input().split()]
comp = 0
for el in range(0, n, 2):
    if A[el] % 2 != 0:
        comp += 1

print(comp)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 = ans + 1


print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

if __name__=='__main__':
    n = I()
    a = list(IL())
    c = 0
    for i,item in enumerate(a):
        if (i+1)%2==1 and item%2==1:
            c+=1
    print(c)
    exit()

Submission status: Accepted

Solution code:
N=int(input())
a=list(map(int,input().split()))
i=1
sum=0
while i<=N:
    if a[i-1]%2!=0:
        sum=sum+1
    i=i+2
print(sum)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
aa = a[::2]

cnt = 0
for i in aa:
    if i % 2 == 1:
        cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    
    n = int(input())
    
    Numbers = list(map(int,input().split()))
    count = 0
    for item in range(1,n+1):
        if item % 2 != 0 and Numbers[item-1] % 2 != 0:
            count += 1
    
    print(count)
        
    
  

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
masu=[int(x) for x in input().split(" ")]
c=0
for i in range(0,N,2):
	if masu[i]%2 !=0: c += 1
print(c)

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
#template
N = int(input())
a = inputlist()
count = 0
for i in range(N):
    if i % 2 == 0 and a[i] % 2 == 1:
        count +=1
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def solve():
    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)
if __name__=='__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())
vals = list(map(int, input().split()))
cnt = 0

for ad, val in enumerate(vals, 1):
    if ad % 2 == 1 and val % 2 == 1:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
n=int(input())
l=[0]
c=0
l=l+(list(map(int,input().split())))

try:
  for i in range(1,n+1,2):
    if l[i]&1:
      c+=1
except:
  pass
print(c)

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
A.insert(0,0)

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

print(ans)

Submission status: Accepted

Solution code:
input()
print(len([i for i in list(map(int,input().split()))[::2] if i%2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

    print(ans)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
list_in_Num = map(int, input().split())
num_list = list(list_in_Num)
oddIndexandoddNum = 0
for i, num in enumerate(num_list, start=1):
    if num % 2 == 1 and i % 2 == 1:
        oddIndexandoddNum += 1
print(oddIndexandoddNum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! python3
# coding:utf-8

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

cnt=0

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

print(cnt)

Submission status: Accepted

Solution code:
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

    return ans

print(main())

Submission status: Accepted

Solution code:
input()
a = list(map(int, input().split()))[::2]
print(sum(x % 2 == 1 for x in a))

Submission status: Accepted

Solution code:
# 標準入力
n = int(input())
input = list(map(int, input().split()))
count = 0
for i in range(n):
    if (i+1) % 2 == 1 and input[i] % 2 == 1:
        count += 1
print(count)

Submission status: Accepted

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
print(sum(a % 2 for a in A[::2]))

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for x in a[::2]:
    ans += x % 2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
s_list = input().split()
count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
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)

Submission status: Accepted

Solution code:
n=int(input())

a=input().split()

b= [int(s) for s in a]

count=0

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

Submission status: Accepted

Solution code:
n = int(input().rstrip())
num_list = [int(x) for x in input().rstrip().split(" ")]
count = 0
for i in range(0,n,2):
  count += num_list[i]%2!=0

print(count)

Submission status: Accepted

Solution code:
x=int(input())
li=list(map(int, input().split()))
res=0
i=0
while i<x:
  if li[i]%2!=0:
    res+=1
  i+=2
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num_of_squares = int(input())
written_values = [i for i in input().split(" ")]
flag = 0
for i in range(num_of_squares):
    if ((i + 1) % 2 != 0) & (int(written_values[i]) % 2 != 0):
        flag += 1
print(flag)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input()
print(sum([int(i)%2 for i in input().split()[::2]]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num1 = int(input())
num = (int(x) for x in input().split())

count = 0

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

print(count)

Submission status: Accepted

Solution code:
n = int(input())
A = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    A = list(map(int, input().split()))
    ans = 0
    for i, a in enumerate(A):
        if i % 2 == 0 and a % 2 == 1:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
nums = [int(i) for i in input().split(' ')]
count = 0
for i in range(0,N,2):
  if nums[i] % 2 != 0:
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = [1 if int(i)%2 else 0 for i in input().split()][::2]
print(sum(A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect


def zz():
    return list(map(int, sys.stdin.readline().split()))


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


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


def C(line):
    return [sys.stdin.readline() for _ in range(line)]


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = [0]+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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline

import math
from collections import defaultdict,deque
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()

"""========main code==============="""

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

Submission status: Accepted

Solution code:
import math

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)

Submission status: Accepted

Solution code:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

N = I()

A = LI()

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys
readline = sys.stdin.readline


def main():
    n = int(readline().rstrip())
    A = list(map(int, readline().rstrip().split()))
    cnt = 0
    for a in range(n):
        if ((a + 1) * A[a]) % 2 == 1:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
L=[int(i) for i in input().split()]
count=0
for i in range(1,n+1,2):
  if(L[i-1]%2!=0):
    count+=1
print(count)

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
a = list(map(int,input().split()))
i=0
for x,y in enumerate (a):
    b=x+1
    if b%2!=0 and y%2!=0:
        i+=1
print(i)

Submission status: Accepted

Solution code:
n = int(input())

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

count = 0

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

print(count)

Submission status: Accepted

Solution code:
_=input()
arr=list(map(int, input().split()))
odd=[n for (n,y) in enumerate(arr,1) if n%2 > 0 and y%2 > 0]
print (len(odd))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
a_list = list(map(int, input().split()))
#print(a_list)
myans = 0
for a, b in enumerate(a_list):
    #print(a,b)
    if (a+1)%2 != 0 and b%2 != 0:
        myans += 1
print(myans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mass=int(input())
number=list(map(int,input().split()))

cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
my_range = int(input())
data_in = list(map(int,input().split()))
n_of_odd = 0
for ind in range(my_range):
  if (ind % 2) == 0:
    rem = data_in[ind] % 2
    n_of_odd = n_of_odd + rem
print(n_of_odd)

Submission status: Accepted

Solution code:
N = input()
inpa = input().split(" ")
count =0
for x in range(0,int(N),2):
    if int(inpa[x])%2==1:
        count = count + 1
print(count)