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: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

n = int(input())
a = list(map(int, input().split()))
a = [a[i] for i in range(n) if i % 2 == 1]
a = np.array(a)
ans = np.sum(a % 2 == 1)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#B
N =  int(input())
a = list(map(int,input().split()))
cou = 0

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

print(cou)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

ans = 0
for i, ele in enumerate(ls):
    if i%2 != 0:
        if ele%2 != 0:
            ans += 1
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

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

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

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
A = [int(i) for i in input().split()]


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

Submission status: Wrong Answer

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

c = 0

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

print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
'''
5
1 3 4 5 7
'''
lens = int(input())
vals = [0] + [int(x) for x in input().split()]
odds = 0
for i in range(1, lens+ 1):
  if i % 2 == 0 and vals[i] % 2 == 0:
    odds += 1
print(odds)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

count = 0

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

if __name__ == "__main__":
  resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

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

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

print(ret)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
As = map(lambda x: int(x), input().split(" "))

result = 0

for i, a in enumerate(As):
    index = i+1
    if a % 2 == 1 and i % 2 == 1:
        result += 1

print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l1 = l[0::2]
cnt = 0
for i in l1:
    if i % 2 == 1:
        cnt += 1
print(l1)

Submission status: Wrong Answer

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


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    _ = readint()
    a = list(readnums())
    ans = 0
    for i, v in enumerate(a):
        if i % 2 and v % 2:
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(i) for i in input().split()]

c = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

n = int(input())
aL = list(map(int, input().split(" ")))

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    print(cnt)




if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
li = list(map(int, input().split()))
ret = 0
for i, l in enumerate(li):
    if i % 2 == 1 and l % 2 == 1:
        ret = ret + 1
print(ret)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n = ii()
A = iil()
cnt = 0
for i,item in enumerate(A):
    if i%2==1 and item%2==1:
        cnt+=1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
'''
5
1 3 4 5 7
'''
lens = int(input())
vals = [int(x) for x in input().split()]
odds = 0
for i in range(lens):
  if i % 2 == 0 and vals[i] % 2 == 0:
    odds += 1
print(odds)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(input())
a_list = list(map(int, input().split()))
count = 0
for i in range(1, n, 2):
    if a_list[i] % 2 == 1:
        count += 1
print(count)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys

input = iter(sys.stdin.read().splitlines()).__next__


sys.setrecursionlimit(10000)

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

res = len([1  for i in range(N) if i % 2 == 1 and A[i] % 2 == 1 ])
print(res)

Submission status: Wrong Answer

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    # 整数 1 つ
    n = int(input())
    # 整数複数個
    # a, b = map(int, input().split())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    A = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

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

    print(cnt)


resolve()

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

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

ans=0
for i in x[1::2]:
    if i%2==1:
        ans+=1

Submission status: Wrong Answer

Solution code:
#B - An Odd Problem
N = int(input())
a= list(map(int,input().split()))
ans = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l1 = l[1::2]
cnt = 0
for i in l1:
    if i % 2 == 1:
        cnt += 1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt = 0

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

print(cnt)

Submission status: Wrong Answer

Solution code:
import sys

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import bisect
import sys
import math
from collections import deque
from heapq import heappush, heappop

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))


INF = 1 << 29

DIV = (10**9) + 7
#DIV = 998244353

def mod_inv_prime(a, mod=DIV):
    return pow(a, mod-2, mod)


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


def CONV_TBL(max, mod=DIV):
    fac, finv, inv = [0]*max, [0]*max, [0]*max
    fac[0] = fac[1] = 1
    finv[0] = finv[1] = 1
    inv[1] = 1
    for i in range(2, max):
        fac[i] = fac[i-1]*i % mod
        inv[i] = mod - inv[mod % i] * (mod//i) % mod
        finv[i] = finv[i-1]*inv[i] % mod

    class CONV:
        def __init__(self):
            self.fac = fac
            self.finv = finv
            pass

        def ncr(self, n, k):
            if(n < k):
                return 0
            if(n < 0 or k < 0):
                return 0
            return fac[n]*(finv[k]*finv[n-k] % DIV) % DIV

    return CONV()


def cumsum(As):
    s = 0
    for a in As:
        s += a
        yield s


sys.setrecursionlimit(200005)


def dijkstra(G,start=0):
    heap = []
    cost = [INF]*len(G)
    heappush(heap,(0,start))
    while len(heap)!=0:
        c,n = heappop(heap)
        if cost[n] !=INF:
            continue
        cost[n]=c
        for e in G[n]:
            ec,v = e
            if cost[v]!=INF:
                continue
            heappush(heap,(ec+c,v))
    return cost


def main():
    N =iRaw()
    As = isRaw()
    ans = [1 if i%2==1 and k%2==1 else 0 for i,k in enumerate(As)]
    print(sum(ans))

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import itertools
import decimal
import math
import collections
import sys
#input = sys.stdin.readline
import copy

# S=(input())
# N=int(input())
# N,K=map(int,input().split())
# ListA=list(map(int,input().split()))
# ListA.sort()#reverse=True)

def resolve():
    
    N=int(input())
    ListA=list(map(int,input().split()))

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

    print(cnt)



resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np


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

    print(ans)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    a = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, a)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(c)

Submission status: Wrong Answer

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

count = 0

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

print(count)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)


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


if __name__ == '__main__':
    main(sys.stdin.readline, print)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

Solution code:
#!python3.8
# -*- coding: utf-8 -*-
# aising2020/aising2020_b
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################

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

Submission status: Wrong Answer

Solution code:
def main():
    n = int(input())
    A = list(map(int,input().split()))
    ans = 0
    for i in range(n):
        if i%2 == 1 and A[i]%2 == 1:
            ans += 1
    print(ans)
    return
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


def read():
    N = int(input().strip())
    A = list(map(int, input().strip().split()))
    return N, A


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


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

Submission status: Wrong Answer

Solution code:
# B

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

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

Submission status: Wrong Answer

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

ans = 0

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
import statistics
import itertools
from collections import deque

n=int(input())
#l,r,d=map(int,input().split())
lis=list(map(int,input().split()))
ans=0
for i in range(n):
    if i%2==1 and lis[i]%2==1:
        ans+=1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
#from collections import deque



def run():
    N, *A = map(int, read().split())
    ans = 0
    for i in range(1, N, 2):
        if A[i] % 2:
            ans += 1

    print(ans)



if __name__ == "__main__":
    run()

Submission status: Wrong Answer

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

cnt = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#import numpy as np
#import functools
#import operator
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#from itertools import permutations as perm
#import collections as C #most_common
#import math
#import sympy

N = int(input())
#N,K,d= map(int,input().split())
A = list(map(int,input().split()))
#S = str(input())
#T = str(input())
c=0

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

Submission status: Wrong Answer

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



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

ans = 0

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

print(ans)

Submission status: Wrong Answer

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

print( sum(i%2==1 and a[i]%2==1 for i in range(n)) )