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

import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [input() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [int(input()) for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def roundUp(a, b):
        return -(-a // b)

    @staticmethod
    def toUpperMultiple(a, x):
        return Math.roundUp(a, x) * x

    @staticmethod
    def toLowerMultiple(a, x):
        return (a // x) * x

    @staticmethod
    def nearPow2(n):
        if n <= 0:
            return 0
        if n & (n - 1) == 0:
            return n
        ret = 1
        while(n > 0):
            ret <<= 1
            n >>= 1
        return ret

    @staticmethod
    def sign(n):
        if n == 0:
            return 0
        if n < 0:
            return -1
        return 1

    @staticmethod
    def isPrime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True


class PriorityQueue:
    def __init__(self, l=[]):
        self.__q = l
        heapq.heapify(self.__q)
        return

    def push(self, n):
        heapq.heappush(self.__q, n)
        return

    def pop(self):
        return heapq.heappop(self.__q)


MOD = int(1e09) + 7
INF = int(1e15)


def main():
    
    N = Scanner.int()
    A = Scanner.map_int()
    odd = sum([x % 2 == 1 for x in A])
    print("YNEOS "[odd % 2::2])
    return


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
result = 0
for i in range(N):
  if A[i] % 2 == 1:
    result += 1
    
print("YES" if result % 2 == 0 else "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 = list(map(int,input().split()))
Odds = list(filter(lambda x:x%2 == 1,A))
Odds_num = len(Odds)
if Odds_num % 2 == 1:
    print("NO")
else:
    print("YES")

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







evens = list(filter(lambda x: x % 2 == 1, numbers))
evens_mod = len(evens) % 2

if evens_mod == 1:
    print("NO")
else:
    print("YES")

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

odds = list(filter(lambda x: x % 2 == 0, numbers))
evens = list(filter(lambda x: x % 2 == 1, numbers))



odds_from_evens = int(len(evens) / 2)
evens_mod = len(evens) % 2
if evens_mod == 1:
    print("NO")
else:
    print("YES")

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
e=0
o=0
for i in range(n):
    if a[i]%2==0:
        e+=1
    else:
        o+=1
if n%2==0 and o%2==0:
    print("YES")
elif n%2!=0 and o%2==0:
    print("YES")
else:
    print("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

ans=["YES","NO"]

print(ans[count%2])

Solution (Python):
input()
a = list(map(int, input().split()))
l = len(list(filter(lambda x : x & 1, a)))
if l & 1:
  print("NO")
else:
  print("YES")

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

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

even = 0
odd = 0

for a in al:
    if a % 2 == 0:
        even += 1
    else:
        odd += 1

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

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

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

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

Solution (Python):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n=ni()
a=nl()
a=[x%2 for x in a]
if sum(a)%2==0:
    print('YES')
else:
    print('NO')

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

Solution (Python):

if __name__ == '__main__':
    N = int(input())
    A = list(map(int, input().split()))
    odd = 0
    even = 0
    for a in A:
        if a % 2:
            odd+=1
        else:
            even+=1
    if odd % 2 == 1:
        print('NO')
    else:
        print('YES')

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

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

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

else:
    print('YES')

Solution (Python):
n = int(input())
li = list(map(int, input().split()))
od = [x for x in li if x%2==1]

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

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

add_or_not = [True if i%2==1 else False for i in a_list]
if sum(add_or_not) %2 == 1:
  print('NO')
else:
  print('YES')

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

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())
li = list(map(int,stdin.readline().rstrip().split()))
count = 0
for i in li:
    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()))

c=0
for n in A:
    if(n%2==1):
        c+=1

if(c%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):
a=int(input())
li = list(map(int,input().split()))

ans = 'NO'

even = []
odd = []

for i in li:
  if i % 2 == 0:
    even.append(i)
  else:
    odd.append(i)

if len(odd) % 2 == 0:
  ans = 'YES'
  
print(ans)

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

even = 0
odd = 0

for i in range(n):
    if tp[i] % 2 == 0:
        even += 1
    elif tp[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()))
o = [a for a in A if a % 2 != 0]


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

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
e = []
o = []
e_append = e.append
o_append = o.append

for a in A:
    if a % 2 == 0:
        e_append(a)
    else:
        o_append(a)

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

Solution (Python):
def examA():
    N = I()
    A = LI()
    ans = "YES"
    cur = 0
    for a in A:
        if a%2==1:
            cur +=1
    if cur%2==1:
        ans = "NO"
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,inf
mod = 10**9 + 7
inf = 10**18

if __name__ == '__main__':
    examA()

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

if odd_cnt % 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==1:
    odd+=1
if odd%2==1:
  print("NO")
else:
  print("YES")

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

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

if kcnt % 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 != 0:
    cnt += 1
print("YES" if cnt % 2 == 0 else "NO")

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10


def solve():
    n = II()
    a = LI()
    print("NO" if sum(map(lambda x: x & 1, a)) & 1 else "YES")
    return



if __name__ == '__main__':
    solve()

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

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

Solution (Python):
N = input()
A = input().split()
count=0
for i in range(int(N)):
  if int(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()))
even=0
odd=0
for i in A:
    if i%2==0:
        even+=1
    else:
        odd+=1

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

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

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

ki=len([i for i in A if i % 2 == 1])

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

"""
・ev,ev -> ev or od,od -> ev
・奇数の個数 mod 2 が不変量
・1回以上操作をすると偶数が1つ以上残る
・N >= 2なので偶数が残る。よってodが奇数個ならむり
・奇数が偶数個なら、奇数を固めたあとつぶしていけばできる
"""

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

od = sum(x&1 for x in A)
answer = 'NO' if od & 1 else 'YES'
print(answer)

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

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

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

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

evens = [nums[i] for i in range(N) if nums[i] % 2 == 0]
odds  = [nums[i] for i in range(N) if nums[i] % 2 != 0]

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

Solution (Python):

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

n = len([a for a in A if a % 2 == 1])
if n % 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()))

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

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

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

o = 0
for a in A :
  if a % 2 == 1 :
    o += 1
    
if o % 2 != 0 :
  print('NO')
else :
  print('YES')

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

Solution (Python):


def main()->None:
    N = int(input())
    A = map(int, input().split())

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

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



if __name__ == "__main__":
    main()

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

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

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
cnt = 0 
for i in A:
        if i % 2 != 0:
                cnt += 1 

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

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

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

odd_cnt = 0
for i in range(n):
    if a[i]%2 == 1:
        odd_cnt += 1
if odd_cnt % 2 == 0 or (odd_cnt == 1 and a.index(1)>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()))
sm = 0
for i in range(N):
    sm += A[i]%2
if sm%2:
    print("NO")
else:
    print("YES")

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

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

temp = 0

for x in a:
    if x % 2 == 1:
        temp += 1
        
if temp % 2 == 1:
    print('NO')
else:
    print('YES')

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

k = []

for i in range(n):
	k.append(l[i]%2)
	
print('YES' if sum(k)%2==0 else 'NO')

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

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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    a = list(map(int, readline().split()))
    cnt = 0
    for v in a:
        if v % 2 != 0:
            cnt += 1
    print("YES" if cnt % 2 == 0 else "NO")


if __name__ == '__main__':
    solve()

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

for _ in range(n):
    
    if(a[_]%2==1):
        cn += 1
    
if(cn%2==1):
    print("NO")
else:
    print("YES")

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

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

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

Solution (Python):
import numpy as np
N = int(input())
Alist = np.array(list(map(int, input().split())))
odd = np.count_nonzero(Alist % 2)
if odd % 2 == 0:
    print("YES")
else:
    print("NO")

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n = inp()
a = inpl()
cnt = 0
for i in a:
    if i%2:
        cnt += 1
if cnt%2:
    print('NO')
else:
    print('YES')

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

Solution (Python):
import os
import sys

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



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

c = 0
for a in A:
    c += a & 1
if c % 2 == 0:
    print('YES')
else:
    print('NO')

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

if sum(map(int, input().split()))%2:
    print("NO")
else:
    print("YES")

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

odd_list = [i for i in a if i%2]
odd_count = len(odd_list)

if (odd_count == 0 or odd_count %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!=0:
        c+=1
if c%2==0:
    print('YES')
else:
    print('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 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):


N = int(input().split()[0])
a_list = list(map(int, input().split()))

odd_n = 0
even_n = 0

for a in a_list:
    if a % 2 == 1:
        odd_n += 1
    else:
        even_n += 1

ans = "YES" if odd_n % 2 == 0 else "NO"

print(ans)

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

cnt_odd = 0
cnt_even = 0

for x in li:
    if x%2 == 0:
        cnt_even += 1
    else:
        cnt_odd += 1
        
if cnt_odd%2 != 0:
    print("NO")
else:
    print("YES")

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, = map(int, input().split())
print("NO" if len(list(filter(lambda x: x%2, a)))%2 else "YES")

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

if N==1:
    print("YES")
    exit()

odd=0
even=0
for item in A:
    if item%2==1:
        odd+=1
    else:
        even+=1

if odd%2==1:
    print("NO")
    exit()
else:
    even+=odd//2
        
print("YES")

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):
input()
list_ = [n % 2 for n in map(int, input().rstrip("\n").split())]

print("NO" if list_.count(1) % 2 else "YES")

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

Solution (Python):

import sys

n = sys.stdin.readline().rstrip()
nums = (int(i) for i in sys.stdin.readline().rstrip().split())

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

Solution (Python):

import sys

n = sys.stdin.readline().rstrip()
nums = (int(i) for i in sys.stdin.readline().rstrip().split())

odds = 0
for a in nums:
  if a % 2 != 0:
    odds += a

if odds % 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 == 1:
        odd += 1
if odd % 2 == 1:
    print("NO")
else:
    print("YES")

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

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

Solution (Python):
def main():
    n = int(input())
    numbers = list(map(int, input().split()))

    temp_numbers = [n % 2 for n in numbers]
    number_of_even = temp_numbers.count(0)
    number_of_odd = temp_numbers.count(1)
    while number_of_odd >= 2:
        temp = number_of_odd // 2
        number_of_even += temp
        number_of_odd -= temp * 2

    while number_of_even >= 2:
        temp = number_of_even // 2
        number_of_even -= temp

    if number_of_even + number_of_odd >= 2:
        print('NO')
    else:
        print('YES')


if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

n = input()
A = np.array(list(map(int, input().split())))

A = np.where(A % 2 == 0, 0, 1)
if sum(A) % 2 == 0:
    print('YES')
else:
    print('NO')

Solution (Python):
import sys
import bisect
import collections
import fractions
import heapq


def slove():
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    a = list(map(int, input().rstrip('\n').split()))
    cnt = 0
    for i in range(n):
        if a[i] % 2 != 0:
            cnt += 1
    if cnt % 2 == 0:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    slove()

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
c=0
for i in range(n):
    if l[i]%2==1:
        c+=1
e=n-c
if c%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 = map(int,input().split())
O = 0
E = 0

for i in A:
    if i % 2 == 1:
        O += 1
    else:
        E += 1
if O % 2 == 0:
    print("YES")
else:
    print("NO")

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

ans = 0
for i in A:
    ans ^= i
if ans % 2 == 0:
    print("YES")
else:
    print("NO")

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

Solution (Python):

N = input()

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


num = 0

for i in A:

    if i % 2 == 1:
        num += 1

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

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

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

Solution (Python):
n = int(input())
m = 0
a = input().split()

for i in range(n):
    m += int(a[i])
    
if m % 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==1:
        odd+=1
if odd %2==0:
    print("YES")
else:
    print("NO")

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

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

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 == 0:
    print("YES")
else:
    print("NO")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
even = []
odd = []

for i in range(len(A)):
    if A[i] % 2 == 0:
        even.append(A[i])

    else:
        odd.append(A[i])

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

else:
    print("YES")

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

lO = [ i for i in A if i % 2 == 1 ]

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

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

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    N = int(input())
    a = list(map(int,input().split()))
    num = 0
    for i in a:
        if i%2 == 1:
            num += 1
    print("YES") if num%2 == 0 else print("NO")

if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
count = 0
for a in A:
    if a % 2 != 0:
        count += 1
if count % 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 = list(map(int,input().split()))

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

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

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

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

if sum(arr) % 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):
def solve(n, a):
    odd = 0
    even = 0
    for x in a:
        if x % 2 == 0:
            even += 1
        else:
            odd += 1
    res = int(odd % 2) + int((even + (odd // 2)) > 0)
    return "YES" if (res == 1) else "NO"

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

Solution (Python):


n = int(input())
def process(x):
    x = int(x)
    if x%2 == 0:
        return 0
    else:
        return 1
data = list(map(process, input().split()))
l = [x for x in data if x == 1]
if len(l)%2==0:
    print('YES')
else:
    print('NO')

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

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

Solution (Python):

def main():
    
    
    N, *A = map(int, open(0).read().split())
    flg = sum(A) % 2 == 0
    print("YES" if flg else "NO")


if __name__ == "__main__":
    main()

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

def main():
    N = int(input())
    a = np.array(list(map(int, input().split())))

    if sum(a % 2)&1:
        print("NO")
    else:
        print("YES")


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
A_odd = list(filter(lambda n:n%2==1, A))
if len(A_odd) % 2 == 0:
    print('YES')
else:
    print('NO')

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

odds = len([i for i in a if i % 2 == 1])
evens = len([i for i in a if i % 2 == 0])

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


class AtCoder:
    def main(self):
        N = int(input())
        A = map(int, input().split())

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



if __name__ == '__main__':
    AtCoder().main()

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

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

odd = 0
for i in range(n):
    if arr[i] % 2 != 0:
        odd += 1

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

Solution (Python):
N,*A=map(int,open(0).read().split());print("YNEOS"[sum(a%2for a in A)%2::2])

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

Solution (Python):
N = int(input())
odd = len(list(filter(lambda x: int(x) % 2, input().split())))
even = N - odd

even += odd // 2
even %= 2
odd %= 2

print('NO' if odd == even == 1 else 'YES')

Solution (Python):
if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
    
    odd_is_even = True
    for Ai in A:
        if Ai % 2 == 1:
            odd_is_even = not odd_is_even
    
    if odd_is_even:
        print("YES")
    else:
        print("NO")

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

Solution (Python):
n = int(input())
print('YNEOS'[sum([i % 2 for i in map(int,input().split())])%2::2])

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    a = list(map(int, input().rstrip('\n').split()))
    cnt = 0
    for v in a:
        if v % 2 != 0:
            cnt += 1
    print("YES" if cnt % 2 == 0 else "NO")


if __name__ == '__main__':
    slove()