Problem:
 Score : 300 points    Problem Statement There are N integers written on a blackboard. The i -th integer is A_i .  Takahashi will repeatedly perform the following operation on these numbers:   Select a pair of integers, A_i and A_j , that have the same parity (that is, both are even or both are odd) and erase them.  Then, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j .   Determine whether it is possible to have only one integer on the blackboard.      Constraints  2 ≦ N ≦ 10^5  1 ≦ A_i ≦ 10^9  A_i is an integer.         Input The input is given from Standard Input in the following format:  N  A_1  A_2 … A_N       Output If it is possible to have only one integer on the blackboard, print YES . Otherwise, print NO .        Sample Input 1 3
1 2 3      Sample Output 1 YES  It is possible to have only one integer on the blackboard, as follows:   Erase 1 and 3 from the blackboard, then write 4 . Now, there are two integers on the blackboard: 2 and 4 .  Erase 2 and 4 from the blackboard, then write 6 . Now, there is only one integer on the blackboard: 6 .        Sample Input 2 5
1 2 3 4 5      Sample Output 2 NO

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

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

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

if cnt_odd % 2 ==1:
    print("NO")
else:
    print("YES")

Solution (Python):
N = int(input())
A_list = [int(e) for e in input().split()]

even_cnt = 0
odd_cnt = 0

for A in A_list:
    if A%2 == 0:
        even_cnt += 1
    else:
        odd_cnt += 1
        





if (odd_cnt == 1 and even_cnt == 0)or(odd_cnt%2==0):
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
odd = 0
for a in A:
  if a % 2 == 1:
    odd ^= 1
if odd == 1:
  print("NO")
else:
  print("YES")

Solution (Python):
N = int(input())
As = input().split()

c_even = 0
c_odd = 0

for A in As:
  if int(A)%2 == 0:
    c_even += 1
  else:
    c_odd += 1

if c_even != 0 and c_odd%2 != 0:
  print("NO")
  exit(0)
print("YES")

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

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

Solution (Python):
def N():
    return int(input())


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


def NL(n):
    return [list(map(int, input().split())) for i in range(n)]

def isEven(num):
  if num%2==0:
    return True
  else:
    return False

n=N()

a=list(map(int, input().split()))
even=0
for number in a:
  if isEven(number):
    even +=1
odd=n-even
if odd%2==1:
  print("NO")
else:
  print("YES")

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

Solution (Python):


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

even = odd = 0
for i in range(N):
    if A[i] % 2 == 0:
        even += 1
    else:
        odd += 1

if odd % 2 != 0:
    print("NO")
else:
    print("YES")

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

n_odd = sum([ai%2 for ai in a])
if(n_odd % 2==0):
    print('YES')
else:
    print('NO')

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

t=sum([i for i in A if i%2!=0])%2
print('YES' if t==0 else 'NO')

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
cnt = 0
for v in l:
  if v % 2 != 0:
    cnt += 1
print('YES' if cnt % 2 == 0 else 'NO')

Solution (Python):
n=int(input())
A=list(map(int,input().split()))
ki=0  ;gu=0
for i in A:
    if i%2==1:
        ki+=1
    else:
        gu+=1
gu+=ki//2
ki%=2
if gu>=1 and ki==1:
    print("NO");exit()
print("YES")

Solution (Python):
n = int(input())
a = [i for i in list(map(int, input().split())) if i % 2 == 1]
print("YES") if len(a)%2==0 else print("NO")

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

Solution (Python):
n = int(input())
a = list(map(lambda x:int(x)%2,input().split()))
if sum(a)%2 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
N=int(input())
L=list(map(int,input().split()))
L=[i for i in L if i%2==1]
if len(L)%2==1:
  print("NO")
else:
  print("YES")

Solution (Python):



def main():
    n = int(input())
    li = list(map(int, input().split()))
    odd = 0
    even = 0
    for i in li:
        if i % 2 == 0:
            even += 1
        else:
            odd += 1
    if odd == 1 and even == 0:
        print("YES")
        return
    if odd % 2 == 1:
        print("NO")
        return
    if odd % 2 == 0 and (even + odd // 2) == 0:
        print("NO")
        return
    print("YES")


if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n):
    a[i] %= 2

count_1=a.count(1)
if count_1 % 2 == 0:
    print("YES")
else:
    print("NO")

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

cnt = 0
for a in A:
  if a % 2 == 1:
    cnt += 1

if cnt % 2 == 0:
  print("YES")
else:
  print("NO")

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

odd_num = sum([1 for a in al if a % 2 == 1])
even_num = len(al) - odd_num

ans = "YES"
if odd_num % 2 == 1:
    ans = "NO"
if odd_num == 1 and even_num == 0:
    ans = "YES"

print(ans)

Solution (Python):
n = int(input())
ls = [int(x) for x in input().split()]
odd = 0
for i in ls:
  if i%2 == 1:
    odd += 1
    
print("YES" if odd%2 == 0 else "NO")

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

for i in a:
    if i % 2 == 1:
        odd += 1

ans = "NO"
if odd % 2 == 1:
    ans = "NO"
else:
    ans = "YES"

print(ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
cnt = 0
for a in A:
    if a%2==1:
        cnt += 1
if cnt%2==1:
    print("NO")
else:
    print("YES")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
num = 0
for i in a:
    if i%2 == 1:
        num += 1
if num%2 == 1:
    print('NO')
else:
    print('YES')

Solution (Python):
import sys, math
from functools import lru_cache
import numpy as np
import heapq
from collections import defaultdict
sys.setrecursionlimit(10**9)
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 lcm(a, b):
    return a*b//math.gcd(a, b)


def main():
    N = ii()
    A = list(mi())
    cnt = 0
    for i in range(N):
        if A[i]%2==1:
            cnt += 1
    if cnt%2 == 1:
        print('NO')
    else:
        print('YES')

if __name__ == '__main__':
    main()

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

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
s=0
for i in A:
    if i%2:
        s+=1
print("YES" if s%2==0 else "NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = list(map(lambda x: x%2, a))
c = b.count(1)
print('YES' if c%2 == 0 else 'NO')

Solution (Python):
N=int(input())
li = list(map(int, input().split()))
if sum(li)%2==0:
  print('YES')
else:
  print('NO')

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

odd=0
for i in l:
    if i%2==1:
        odd+=1

if odd%2==0: print('YES')
else: print('NO')

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

n_odd = sum(ai % 2 for ai in a)
n_even = (n - n_odd) + n_odd // 2

if n_even > 0:
    if n_odd % 2 == 0:
        ans = 'YES'
    else:
        ans = 'NO'
else:
    if n_odd % 2 == 0:
        ans = 'NO'
    else:
        ans = 'YES'
print(ans)

Solution (Python):
'''
Created on 2020/08/21

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  N=int(pin())
  A=list(map(int,pin().split()))
  cnt=0
  for i in A:
    if i%2==1:
      cnt+=1
  if cnt%2==0:
    print("YES")
  else:
    print("NO")
  return 

main()

Solution (Python):
n = int(input())
a = map(int, input().split())
print('YES' if sum(a) % 2 == 0 else 'NO')

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

cnt = 0
for a in A:
    if a % 2 != 0:
        cnt += 1

if cnt % 2 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
print("YES" if sum(A)%2==0 else "NO")

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

odds = []
evens = []
for i in num_lists:
    if i%2 == 0:
        evens.append(i)
    else:
        odds.append(i)

odds_sum = 0
for i in odds:
    odds_sum += i

if odds_sum%2 == 0:
    ans = 'YES'
else:
    ans = 'NO'

print(ans)

Solution (Python):




import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3
1 2 3"""
        output = """YES"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """5
1 2 3 4 5"""
        output = """NO"""
        self.assertIO(input, output)


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

    e = 0
    o = 0
    for a in A:
        if a % 2 == 0:
            e += 1
        else:
            o += 1

    if o % 2 == 0:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    
    resolve()

Solution (Python):
def solve():

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

    Odd = 0

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

    if Odd%2 == 0:
        print("YES")
    else:
        print("NO")

if __name__ == "__main__":
    solve()

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

    odd_even = {"odd": 0, "even": 0}

    for num in A:
        if num % 2 == 0:
            odd_even["even"] += 1
        else:
            odd_even["odd"] += 1

    if odd_even["odd"] % 2 == 0:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()

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

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
Odd = 0
Even = 0
for Ai in A:
    if Ai % 2 == 0:
        Even += 1
    else:
        Odd += 1
if Odd % 2 == 1:
    print('NO')
else:
    print('YES')

Solution (Python):
import collections


def main():
    _ = int(input())
    print("YES" if collections.Counter(list(map(lambda x: int(x) %
                                                2, list(map(int, input().split())))))[1] % 2 == 0 else "NO")


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
l = [1 for i in input().split() if int(i)%2]
print("NO" if len(l)%2 else "YES")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
tmp = [i for i in A if i%2 != 0]

if (len(tmp))%2 != 1:
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
if sum(a) % 2 == 0:
    print("YES")
else:
    print("NO")

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


odds = len([a for a in A if a % 2 == 1])

if odds % 2 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    A = list(map(int, readline().split()))
    count = 0
    for a in A:
        if a%2==1:
            count += 1
    if count%2==1:
        print('NO')
    else:
        print('YES')


if __name__ == '__main__':
    main()

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

    odd  = 0
    for a in A:
        if a % 2 == 1:
            odd += 1

    if odd % 2 == 0:
        print("YES")
    else:
        print("NO")
        
if __name__ == "__main__":
    main()

Solution (Python):
N=int(input())
A=[x for x in list(map(int,input().split())) if x%2!=0]

if len(A)%2==0:
  print('YES')
else:
  print('NO')

Solution (Python):


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

if sum(a)%2 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):


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

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

if cnt%2 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
n = int(input())
a = [int(s) for s in input().split()]
if sum(a) % 2 == 0:print("YES")
else:print("NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split(' ')))
sum = 0
for i in range(n):
    sum += a[i]
if sum % 2 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instr = lambda: sys.stdin.readline()
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

n = inint()
A = inintl()

odd = 0

for a in A:
    if a % 2 == 1:
        odd += 1

print("YES") if odd % 2 == 0 else print("NO")

Solution (Python):
from collections import Counter

n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    a[i]%=2
c=Counter(a)
if c[1]%2==1:
    print("NO")
else:
    print("YES")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
odd = 0
for aa in a:
    if aa % 2 == 1:
        odd += 1
if odd % 2 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
if sum(a)%2==0:
    print("YES")
else:
    print("NO")

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

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

print("YES" if sum(a)%2==0 else "NO")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in a:
    if i % 2 == 1:
        cnt += 1
if n == 1 or cnt % 2 == 0:
    print("YES")
else:
    print("NO")

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

li_pm = [0 if i%2==0 else 1 for i in li]

if (li_pm.count(1))%2 == 0:print('YES')
else:print('NO')

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
cnt = 0
for a in A:
    if a % 2 == 1:
        cnt += 1
print('YES' if cnt % 2 == 0 else 'NO')

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
b = 0
for i in a:
  if i % 2 ==1:
    b += 1
if b % 2 ==0:
  print('YES')
else:
  print('NO')

Solution (Python):
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
    n, *a = map(int, read().split())
    if sum(a)&1:
        print('NO')
    else:
        print('YES')

if __name__ == '__main__':
    main()

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

odd = 0
for i in a:
  if i%2 == 1:
    odd += 1

if odd %2 == 1:
  print ('NO')
else:
  print ('YES')

Solution (Python):
n = int(input())
a = list(map(int, input().split(" ")))
even = []
odd = []
for i in a:
    if i % 2 == 0:
        even.append(i)
    else:
        odd.append(i)

ans = "YES"
if len(odd) % 2 == 1:
    ans = "NO"
print(ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
m=0
for i in a:
  m+=i%2
print(['YES','NO'][m%2])

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
m=0
ans=['YES','NO']
for i in a:
  m+=i%2
print(ans[m%2])

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    n = int(readline())
    a = list(map(int, readline().split()))
    odd = [x % 2 == 1 for x in a].count(True)
    even = n - odd

    flag = False
    if odd == 0:
        if even >= 2:
            flag = True
    elif odd % 2 == 0:
        flag = True

    print("YES") if flag else print("NO")


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = len([i for i in input().split() if int(i)%2 == 1])
if a%2 == 0: print('YES')
else: print('NO')

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
print("YES" if not sum(A)%2 else "NO")

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


import numpy as np
A=np.array(A)
B=list(A%2)
if B.count(1)%2==1:
    print('NO')
else:
    print('YES')

Solution (Python):

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

for i in a:
    if i % 2 == 1:
        k += 1

if k % 2 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):

N = int(input())
A = list(map(int, input().split()))
cnt = 0
for i in A:
    if i % 2 == 1:
        cnt += 1
if cnt % 2 == 1:
    print('NO')
else:
    print('YES')

Solution (Python):
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

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

    cnt = 0
    for a in A:
        cnt += a&1
    if cnt&1:
        print("NO")
    else:
        print("YES")


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

N = k()
A = l()

for i in A:
    if i % 2 == 1:
        ans += 1

if ans % 2 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
lst = list(map(lambda x: int(x) % 2, input().split()))
print(['NO', 'YES'][lst.count(1) % 2 == 0])

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

count = 0
for i in a:
  if i%2 == 1:
    count += 1
if count%2 == 1:
  print('NO')
else:
  print('YES')

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

odd_count = 0
for i in a:
    if i % 2:
        odd_count += 1
print('NO' if odd_count % 2 else 'YES')

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

odd_num = 0

for i in a:
    if i % 2 == 1:
        odd_num += 1

if odd_num % 2 == 0:
    print('YES')
else:
    print('NO')

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

a = list(map(int,input().split()))
odd = 0
for i in range(N):
    if a[i] % 2:
        odd += 1
if odd % 2:
    print('NO')
else:
    print('YES')

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

count_odd = sum([a%2==1 for a in A])
if count_odd%2==1 and count_odd>=1:
  print('NO')
else:
  print('YES')

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

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
S=0
for i in A:
    S+=i
print('YES' if S%2==0 else 'NO')

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

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

Solution (Python):
num=int(input())
val=0
for i in input().split():
  val+=int(i)
print("YES" if val%2==0 else "NO")

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

print('YES' if sum(A)%2 ==0 else 'NO')

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

for i in a:
    if i % 2 == 1:
        odd += 1

if odd % 2 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
print('YES' if sum(A) % 2 == 0 else 'NO')

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
EO = [i % 2 for i in A]
print('YES' if EO.count(1) % 2 == 0 else 'NO')

Solution (Python):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in a:
    if i % 2 == 1:
        s += 1
if s % 2 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
n = input()
l = list(map(int, input().split()))
odd = list(filter(lambda x: (x % 2 != 0), l))
if len(odd)%2==0:
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
a = list(map(int,input().split()))
s = 0
for i in a:
    if i % 2 == 1:
        s += 1
if s % 2 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
n=int(input())
x=list(map(int,input().split()))
a=[]
for i in x:
  if i%2==1:
      a+=[i]
if len(a)%2==1:
  print('NO')
else:
  print('YES')

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
if sum(a)%2 == 0:
    print("YES")
else:
    print("NO")

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

Solution (Python):

from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right

def main():
    N = int(input())
    A = list(map(int, input().split()))
    count = 0
    for i in range(N):
        if A[i] % 2 == 1:
            count +=1 
    if count % 2 == 0:
        print('YES')
    else:
        print('NO')

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
b = 0
for i in a:
  if i % 1== 0:
    b+= i
if b % 2 == 0:
  print("YES")
else :
  print("NO")

Solution (Python):
n = int(input())
a = 0
for i in map(int, input().split()):
  a = a + i
if a % 2 == 0:
  print("YES")
else:
  print("NO")

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
S = 0
for i in L:
  S += int(i)
print('YES' if S%2 == 0 else 'NO')

Solution (Python):
n=int(input())
c=0
for i in input().split():
  c+=int(i)
print("YES" if c%2==0 else "NO")

Solution (Python):
n=int(input())
cnt=0
a=list(map(int,input().split()))
for i in a:
  if i%2==1:
    cnt=1-cnt
if cnt==0:
  print("YES")
else:
  print("NO")

Solution (Python):
n = int(input())
s = 0
for i in input().split(' '):
 s += int(i)
print("YES" if s%2 == 0 else "NO")

Solution (Python):
import sys

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

N, *A = map(int, read().split())

print('NO' if sum(A) & 1 else 'YES')

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


odd = 0

for i in range(N):
  if A[i] % 2 !=0:
    odd += 1
    
    
if odd % 2 !=0 :
  print('NO')
else:
  print('YES')

Solution (Python):
import numpy as np
n = int(input())
argList = np.array(list(map(int, input().split())) )

g = sum(argList % 2 == 0)
k = sum(argList % 2 == 1)

flag = False
if( k % 2 == 0):
    
    flag = True
if flag:
    print('YES')
else:
    print('NO')

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
cnt = 0
for i in a:
    if(i % 2 != 0):
        cnt = cnt + 1
if (cnt % 2 == 0): print("YES")
else: print("NO")

Solution (Python):
n = int(input())
a_l = list(map(int, input().split()))
k = len([ i for i in a_l if i%2 != 0])
ans = 'NO'
if k % 2 == 0:
    ans = 'YES'
print(ans)

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

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

nodd = sum(a % 2 for a in A)
if nodd % 2 == 0:
    print("YES")
else:
    print("NO")

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

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

if c % 2 == 1:
    print('NO')
else:
    print('YES')

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

    bucket = [0]*2

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

    if bucket[1]%2 == 0:
        return 'YES'
    else:
        return 'NO'

print(main())

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

odd = sum([num%2!=0 for num in a])
even = n-odd
if odd%2==0:
    print("YES")
else:
    print("NO")

Solution (Python):
n=int(input())
a=map(int,input().split())
if sum(a)%2==0:
  print('YES')
else:
  print('NO')

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

print('YES' if a%2==0 else 'NO')

Solution (Python):
n, *lst = map(int, open(0).read().split())
print('NO' if sum(lst) % 2 else 'YES')

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

count = 0
for x in a:
    if x % 2 != 0:
        count += 1
if count % 2 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
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 zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

N = INT()
A = LIST()

cnt = 0
for x in A:
	if x%2:
		cnt += 1

print("NO" if cnt%2 else "YES")

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

l = [a[i] % 2 for i in range(n)]
print('YES' if l.count(1) % 2 == 0 else 'NO')

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

odd, eve = 0, 0
for x in a:
  if x&1: odd += 1
  else: eve += 1
print("YES" if odd%2 == 0 else "NO")

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






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






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




N =I()
L = IL()
if sum(L)%2:
  print("NO")
else:
  print("YES")

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

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

print("YES" if cnt % 2 == 0 else "NO")

Solution (Python):
num_of_odd = num_of_even = 0
N = int(input())
buff = []
for n in map(int, input().split()):
    
    if n % 2:
        num_of_odd += 1
    else:
        num_of_even += 1
    buff.append(n)


if num_of_odd:
    if num_of_odd % 2:
        if num_of_odd == 1 and num_of_even == 0:
            print('YES')
        else:
            print('NO')
    else:
        print('YES')
else:
    pirnt('YES')

Solution (Python):
num_of_odd = num_of_even = 0
N = int(input())
buff = []
for n in map(int, input().split()):
    
    if n % 2:
        num_of_odd += 1
    else:
        num_of_even += 1
    buff.append(n)


if num_of_odd:
    if num_of_odd % 2:
        if num_of_odd == 1 and num_of_even == 0:
            print('YES')
        else:
            print('NO')
    else:
        print('YES')
else:
    pirnt('YES')

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


modsum = 0
for i in A_list:
    modsum += i % 2

if modsum % 2 == 0:
    print("YES")
else:
    print("NO")