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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    n=int(input())
    A=list(map(int,input().split()))
    cnt=0
    for k,v in enumerate(A):
        if k%2==0 and v%2==1:
            cnt+=1
    print(cnt)
    
resolve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import *

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

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)

def main():
    n = int(ipt())
    a = [int(i) for i in ipt().split()]
    num = 0
    for i,ai in enumerate(a):
        if i%2 == 0 and ai%2:
            num += 1
    print(num)

    return None

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    A = il()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


def main():
    N = int(input())
    A = inpl()
    print(len([i for i, a in enumerate(A) if i % 2 == 0 and a % 2 == 1]))

    return


if __name__ == '__main__':
    main()

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 a[i]%2 and i%2 == 0:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

n=int(input())
a=lnii()

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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())
a = [int(x) for x in input().split()]

ans = 0
for i in range(n):
    if (i+1) % 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()))

res = 0

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

print(res)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

Submission status: Accepted

Solution code:
N = int(input())
*A, = map(int, input().split())
ans = 0
for i, a in enumerate(A, 1):
    if i % 2 == 1 and a % 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:
import sys
sys.setrecursionlimit(500000)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

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

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


def main():
    N = ii()
    a = list(mi())
    cnt = 0
    for i in range(N):
        if i%2 == 0 and a[i]%2 == 1:
            cnt += 1
    print(cnt)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return [LIST() for _ in range(n)]
def NSTR(n): return [input() for _ in range(n)]


INF = float("inf")
MOD = 10**9 + 7


def main():
    N = INT()
    A = LIST()
    count = 0
    for i, a in enumerate(A, start=1):
        if i % 2 == 1 and a % 2 == 1:
            count += 1
    print(count)

    return


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%2==0 and a[i]%2==1:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = [int(hoge) for hoge in input().split()]
print(sum([x%2 for n,x in enumerate(A) if n%2 == 0 ]))

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

print(cnt)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.buffer.readline()[:-1]
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
a = LIST()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, *A = map(int, open(0).read().split())
cnt = 0
for i, a in enumerate(A):
    if (i+1) & 1 and a & 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(n):
    if i%2==0 and a[i]%2==1:
        b+=1
print(b)

Submission status: Accepted

Solution code:
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

n=I()
a=L()
ans=0
for i in range(n):
    if i+1&1 and a[i]&1:
        ans+=1
print(ans)

Submission status: Accepted

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


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 % 2 == 0:
        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 % 2 == 0 and a[i] % 2 == 1:
        ans += 1

print (ans)

Submission status: Accepted

Solution code:
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    N = int(input())
    A = list(map(int, input().split()))
    count = 0
    for i, ai in enumerate(A):
        if (i + 1) % 2 == 1 and ai % 2 == 1:
            count += 1
    print(count)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n = I()
    a = LI()
    ans = 0
    for i in range(n):
        if not i&1:
            if a[i]&1:
                ans += 1
    print(ans)
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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:
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    N=I()
    a=LI()
    cnt=0
    for i in range(N):
        if i%2==0 and a[i]%2==1:
            cnt+=1
            
    print(cnt)

main()

Submission status: Accepted

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

Submission status: Accepted

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


    return c

print(main())
#print('Yes' if main() else 'No')
#print('YES' if main() else 'NO')

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

Submission status: Accepted

Solution code:
# じょえチャンネルおもしろいよ～～～
# https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ

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: Runtime Error

Solution code:
def main():
    n, *a = map(int, read().split())
    r = 0
    for i1, ae in enumerate(a):
        if (i1+1)&1 and ae&1:
            r += 1
    print(r)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
asd

Submission status: Runtime Error

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: Runtime Error

Solution code:
N = int(input())
numList = list()
for i in range(N):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    elif i % 2 != 0 and ctr % 2 != 0:
        sum = sum + 1
    ctr = ctr + 1
print(sum)

Submission status: Runtime Error

Solution code:
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    elif i % 2 != 0 and ctr % 2 != 0:
        sum = sum + 1
    ctr = ctr + 1
print(sum)

Submission status: Runtime Error

Solution code:
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    else:
        if i % 2 != 0 and ctr % 2 != 0:
            sum = sum + 1
    ctr = ctr + 1
print(sum)

Submission status: Runtime Error

Solution code:
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    else: i % 2 != 0 and ctr % 2 != 0:
        sum = sum + 1
    ctr = ctr + 1
print(sum)

Submission status: Runtime Error

Solution code:
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    if i % 2 != 0 and ctr % 2 != 0:
        sum = sum + 1
    ctr = ctr + 1
print(sum)

Submission status: Runtime Error

Solution code:
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i % 2 != 0 and ctr % 2 != 0:
        sum = sum + 1
    ctr = ctr + 1
print(sum)

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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%2==1:
            cnt+=1
    print(cnt)
if __name__=='__main__':
    solve()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# 標準入力
range = int(input())
input = list(map(int, input().split()))

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

Submission status: Runtime Error

Solution code:
# 標準入力
range = input()
input = list(map(int, input().split()))

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

Submission status: Runtime Error

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

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input('N='))
a=[]
for i in range(N):
  a.append(int(input'a='))

count=0
if N%2==0:
  n=N/2
else:
  n=(N-1)/2

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

print(count)

Submission status: Runtime Error

Solution code:
N=input()
a=0
for i in range(0,int(N),2):
    s=input()
    if s%2!=0:
        a=a+1
print(a)

Submission status: Runtime Error

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: Runtime Error

Solution code:
n=int(input)
L=[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: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
a = list(int,map(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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(cnt)

Submission status: Runtime Error

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

cnt = 0

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

print(cnt)

Submission status: Runtime Error

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

cnt = 0

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

Submission status: Runtime Error

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

cnt = 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

// travel only even index in 0 based system
ans = 0
for i in range(0,n,2):
	if arr[i] % 2 ==1:
		ans += 1
print(ans)

Submission status: Runtime Error

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

// travel only even index in 0 based system
ans = 0
for i in range(0,n,2):
	if arr[i] % 2 == 1:
		ans += 1

print(ans)

Submission status: Runtime Error

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

// travel only even index in 0 based system
ans = 0
for i in range(0,n):
	if arr[i] % 2 == 1 and (i+1)&1 ==1:
		ans += 1

print(ans)

Submission status: Runtime Error

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

ans=0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(res

Submission status: Runtime Error

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

Submission status: Runtime Error

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

count = 0

for i in range(int(N/2)+1):
  cd = 2 * i
  jd = a[cd]
  if jd % 2 == 1:
    count += 1

print(count)

Submission status: Runtime Error

Solution code:
N = int(input())
a = []
a = input().split()

count = 0

for i in range(int(N/2) + 1):
  cd = 2 * i - 2
  jd = int(a[cd])
  if jd % 2 == 1:
    count += 1
    

print(count)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
maximum = input()
n = list(map(int, input().split()))
odds = [i for i in range(min(n), maximum, 2)]
print(len(odds))

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(i) for i in range (1,n+1)]
b = 0

if i%2==1 and a[i-1]%2==1 :
  b +=1
else:
  b +=0

print(b)

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(i) for i in range (1,n+1)]
b = 0

if i%2==1 and a[i-1]%2==1 :
  b +=1
else:
  b +=0
print(b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(cnt)