Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.Each apple weights 100 grams or 200 grams. Of course Kitahara Haruki doesn't want to offend any of his friend. Therefore the total weight of the apples given to Touma Kazusa must be equal to the total weight of the apples given to Ogiso Setsuna.But unfortunately Kitahara Haruki doesn't have a knife right now, so he cannot split any apple into some parts. Please, tell him: is it possible to divide all the apples in a fair way between his friends?

The first line contains an integer n (1 ≤ n ≤ 100) — the number of apples. The second line contains n integers w1, w2, ..., wn (wi = 100 or wi = 200), where wi is the weight of the i-th apple.

In a single line print "YES" (without the quotes) if it is possible to divide all the apples between his friends. Otherwise print "NO" (without the quotes).

NoteIn the first test sample Kitahara Haruki can give the first and the last apple to Ogiso Setsuna and the middle apple to Touma Kazusa.

n = int(input())
a = list(map(int,input().split()))
s1 = a.count(100)
s2 = a.count(200)
if(n==1):
    print('NO')
    exit(0)
if(s1==0):
    if(s2%2):
        print('NO')
    else:
        print('YES')
elif(s2==0):
    if(s1%2):
        print('NO')
    else:
        print('YES')
else:
    if((s1+s2*2)%2):
        print('NO')
    else:
        print('YES')

n=int(input())
arr=[int(x)//100 for x in input().split(' ')]
one=arr.count(1)
two=n-one
if sum(arr)&1:
	print("NO")
else:
	if two:
		if sum(arr)//2 % 2==0:
			print("YES")
		else:
			if one:
				print("YES")
			else:
				print("NO")
	else:
		print("YES")

n = int(raw_input())
apples = map(int, raw_input().split())

n1 = apples.count(100)
n2 = apples.count(200)

if (n1 + 2 * n2) % 2 != 0:
    print 'NO'
else:
    v = (n1 + 2 * n2) / 2
    if v % 2 != 0 and n1 == 0:
        print 'NO'
    else:
        print 'YES'

n = int(input())
apples = []
apples[0:n-1] = input().split()
weight = []
sum = 0
for i in range(n):
    sum += int(apples[i])
    weight.append(int(apples[i]))
count100 = 0
if sum/100%2:
    print("NO")
else:
    tk,os = 0,0
    for i in weight:
        if (i == 200):
            if tk > os:
                os += i
            else:
                tk += i
        else:
            count100 += 1
    #print(tk,os,abs(tk - os)/100)
    count100 -= abs(tk - os)/100
    #print(count100)
    if (count100 >= 0):
        tk = os
        if (count100%2 == 0):
            print("YES")
        else:
            print("NO")
    else:
        print("NO")

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

cont = 0

for i in range(n):
  if weight[i] == 100:
    cont = cont + 1

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

import operator
from sys import stdin

n = int(input())
k = [int(i) for i in stdin.readline().split()]
o = k.count(100)
t = k.count(200)
if (o + (t*2)) % 2 == 1: print("NO")
elif (t%2==1 and o < 1): print("NO")
else: print("YES")

n=int(input())
a=list(map(int,input().split()))
p=a.count(100)
q=a.count(200)
if p>0 and q==0:
    if p%2==0:
        print("YES")
    else:
        print("NO")
elif q>0 and p==0:
    if q%2==0:
        print("YES")
    else:
        print("NO")
else:

    if p>q:
        z=2*q
        k=1*p
        if z==k or (z%2==0 and k%2==0):
            print("YES")
        else:
            print("NO")
    elif q>p:
        z=2*q
        k=1*p
        if z==k or (z%2==0 and k%2==0):
            print("YES")
        else:
            print("NO")
    else:

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

n = int(input())
a = [int(i) for i in input().split()]
if a.count(200) == n and n % 2 != 0:
  print('NO')
else:
  b = sum(a)
  if b % 200 == 0:
    print('YES')
  else:
    print('NO')

import sys
input = sys.stdin.readline
n = int(input())
a = b = 0
for i in input().split():
    if int(i) == 100:
        a += 1
    else:
        b += 1
if a%2 == 1 or (a==0 and b%2 == 1):
    print("NO")
    sys.exit()
if a%2 == 0:
    print("YES")
    sys.exit()
else:
    print("NO")
    sys.exit()

n=int(input())
a=[int(x)//100 for x in input().split()]
if sum(a)%2==1 or (min(a)==2 and sum(a)%4!=0):
    print("NO")
else:
    print("YES")

n = int(input())
lst = list(map(int, input().split()))
od,ev = 0,0
for i in range(n):
    if lst[i] == 200:
        od += 1
    else:
        ev += 1
if ((not(od % 2)) and (not(ev % 2))) or ((od % 2) and (ev > 1) and (not(ev%2))):
    print('YES')
else:
    print('NO')

import sys
from time import time

n=int(sys.stdin.readline().strip('\n'))
line=sys.stdin.readline().strip('\n').split(" ")
w=map(lambda x:int(x),line)
num100=0
num200=0
for x in w:
    if x==100:
        num100+=1
    else:
        num200+=1
if num100%2==0 and (num200%2==0 or num100>0):
    print "YES"
else:
    print "NO"

n=int(input())
l=input().split()
s,s1,s2=0,0,0
for i in range(n):
    l[i]=int(l[i])//100
    if(l[i]==1):
        s1+=1
    else:
        s2+=1
    s+=l[i]
if(s%2!=0 or (n==s2 and s2%2!=0)):
    print("NO")
else:
    print("YES")

l=lambda:map(int,raw_input().split())
n=input()
a=l()
x, y = a.count(100), a.count(200)
if x&1 or (y&1 and x==0):
    print 'NO'
else:
    print 'YES'

def solve():
        n = int(input())
        w = list(map(int , input().split()))
        s = sum(w) // 100
        if s % 2 == 1 or (n % 2 == 1 and s / 2 == n) : print("NO")
        else : print("YES")

T = int(1)
while T :
        solve()
        T = T - 1

n = int(raw_input())
apples = raw_input().split()
apples = map(int, apples)
soma = sum(apples)

if n <= 1:
	print "NO"
elif soma == 200 * n and n % 2 != 0:
	print "NO"
elif soma % 200 == 0:
	print "YES"
else:
	print "NO"

n = int(input())
weights = input().split()
weights = [int(w) for w in weights]

count100 = 0
count200 = 0
for i in range(n):
    if weights[i] == 100:
        count100 += 1
    elif weights[i] == 200:
        count200 += 1
if count200 % 2 == 0:
    if count100 % 2 == 1:
        print('NO')
    else:
        print('YES')
else:
    if count100 == 0:
        print('NO')
    elif count100 % 2 == 1:
        print('NO')
    else:
        print('YES')

n = int(raw_input())
w = map(int, raw_input().split())

# s = sum(w)
# if (s / 100) % 2 != 0:
#     print "NO"
# else:
#     pass

n_100 = len(filter(lambda x: x == 100, w))
n_200 = n - n_100

if n_200 % 2 == 0 and n_100 % 2 == 0:
    print "YES"
elif n_200 % 2 != 0 and n_100 >= 2 and n_100 % 2 == 0:
    print "YES"
else:
    print "NO"

n = input()
w = [int(wi) for wi in raw_input().split(" ")]
sumw = sum(w)
if 100 in w and (sumw%200) == 0:
	print "YES"
	exit()
elif (sumw%400) == 0:
	print "YES"
	exit()
print "NO"

n=int(input())
l=list(map(int,input().split()))
if l.count(100)/2==l.count(200):
    print("YES")
elif (l.count(100))%2==0 and l.count(100)>0:
    print("YES")
elif l.count(100)==0 and (l.count(200))%2==0:
    print("YES")
else:
    print("NO")

n=int(raw_input())
a = map(int, raw_input().split())
x,y = 0,0
for i in a:
    if i==100:
        x+=1
    else:
        y+=1
if x>=2 and x%2==0:
    print "YES"
elif x==0 and y%2==0:
    print "YES"
else:
    print "NO"

n = int(input())
a = [int(x) for x in input().split()]
print('NO' if sum(a) / 100 % 2 or n == 1 or (sum(x % 200 for x in a) == 0 and n % 2) else 'YES')

#mudando para reenvio

n = int(raw_input())

apples = [int(x) for x in raw_input().split()]
ap1 = 0
ap2 = 0

for i in apples:
	if i==100:
		ap1+=1
	else:
		ap2+=1
if ap1>ap2:
	if ap2==0:
		if ap1%2==0:
			print "YES"
		else:
			print "NO"
	elif ap1%2==0:
		print "YES"
	else:
		print "NO"
elif ap1<ap2:
	if ap1==0:
		if ap2%2==0:
			print "YES"
		else:
			print "NO"

	elif ap2%2==0:
		if ap1%2==0:
			print "YES"
		else:
			print "NO"
	else:
		if ap1%2==0:
			print "YES"
		else:
			print "NO"
else:
	if ap1%2==0:
		print "YES"
	else:
		print "NO"

n=int(input())
l=[int(i) for i in input().split()]
s=sum(l)
dp=[0]*(s+5)
dp[0]=1
for i in l:
    for j in range(s+5):
        if i<=j:
            if dp[j-i]:
                dp[j]=1
if s%2!=0:
    print('NO')
    exit()
print('YES' if dp[s//2] else 'NO')

n = int(input())
nums = [int(x)//100 for x in input().split()]
if sum(nums)%2 == 1 or (min(nums)==2 and sum(nums)%4!=0):
	print("NO")
else:
	print("YES")

num_apple=int(input())
weight=input().split()
if num_apple!=1:
    count1=0
    count2=0
    i=0
    while i<len(weight):
        if '100' == weight[i]:
            count1+=1
        i+=1
    j=0
    while j<len(weight):
        if '200' == weight[j]:
            count2+=1
        j+=1
    if count1%2==0 and count2%2==0:
        print("YES")
    elif count1%2!=0 and count2%2!=0:
        print("NO")
    elif count1%2!=0 and count2%2==0:
        print("NO")
    elif count1%2==0 and count2%2!=0:
        if count1==0 and count2%2!=0:
            print("NO")
        else:
            print("YES")
else:
    print("NO")

n = int(input())
lst = list(map(int, input().split()))
touma = 0
ogiso = 0
lst.sort(reverse=True)
newlst = lst.copy()
y = int(sum(lst)/2)

for item in lst:
    if touma + item <= y:
        touma = touma + item
        newlst.remove(item)
        continue
    if ogiso + item <= y:
        ogiso = ogiso + item
        newlst.remove(item)
if touma == ogiso and len(newlst) == 0:
    print('YES')
else:
    print('NO')

n=int(input())
s=input().split()
c1=s.count('100');c2=n-c1
print('YES'if c1 and c2 and c1==2*c2 or not c2 and not c1%2 or not c1 and not c2%2 or c1>c2%2 and (c1-2*c2%2)%2==0 else 'NO')

n = int(raw_input())

num = map(int, raw_input().strip().split())

if sum(num) / 2 % 100 != 0 or n == 1 or (sum(num) / 2 % 200 != 0 and num.count(100) == 0): print "NO"
else: print "YES"

n=int(input())
s=list(map(int,input().split()))
a=sum(s)
s.count(100)
s.count(200)

if (a//2)%100==0:
    if s.count(100)%2==0 and s.count(200)%2==0:
            print('YES')
            exit()

    if s.count(100)>1 and s.count(200)%2==1:
        print('YES')
        exit()

print('NO')

n,r = int(raw_input()),[int(c) for c in raw_input().split()]
print ['NO','YES'][sum(r)%400 == 0 or (sum(r)%200 == 0 and 100 in r)]

if __name__ == '__main__':
    n = int(input())
    lines = str(input()).split()
    lines = [int(it) for it in lines]
    num_200 = sum(lines) // 100 - n
    num_100 = n - num_200
    if num_200 % 2 > 0:
        if num_100 < 2 or num_100 % 2 > 0:
            print('NO')
        else:
            print('YES')
    else:
        if num_100 % 2 > 0:
            print('NO')
        else:
            print('YES')

n =map(int,raw_input())
weights = map(int,raw_input().split())
total = sum(weights)
if total%200!=0:
    print "NO"
else:
    req_weight = total/2;
    hundred_bsc=0;
    twohundred_bsc=0;
    flag=0
    for i in range(0,len(weights)):
        if weights[i] == 100:
            hundred_bsc += 1;
        else:
            twohundred_bsc += 1;
    if req_weight%200==0:
        if req_weight/200 <= twohundred_bsc:
            twohundred_bsc -= req_weight/200
            flag=1
        elif req_weight/100 <= hundred_bsc:
            hundred_bsc -= req_weight/100
            flag=1
        else:
            temp_weight = twohundred_bsc*200;
            twohundred_bsc=0;
            if((req_weight - temp_weight)/100 <= hundred_bsc):
                hundred_bsc -= (req_weight-temp_weight)/100;
                flag=1
    elif req_weight%100 == 0:
        if req_weight/100 <= hundred_bsc:
            hundred_bsc -= req_weight/100;
            flag=1;
        else:
            temp_bsc = 1;
            while((temp_bsc <= hundred_bsc) and (flag==0)):
                temp_weight = temp_bsc*100;
                var = req_weight - temp_weight
                if((var/200) <= twohundred_bsc):
                    twohundred_bsc -= (var)/200;
                    flag=1;
                else:
                    temp_bsc += 2;
            if flag==1:
                hundred_bsc -= temp_bsc;
    if flag==1:
        #print hundred_bsc
        #print twohundred_bsc
        if((hundred_bsc*100 + twohundred_bsc*200)==req_weight):
            print "YES"
        else:
            print "NO"
    else:
        print "NO"

n = int(input())
arr = map(int, input().split())
c = d = 0

for x in arr:
    if x == 100:
        c+=1
    else:
        d+=1

d = d&1

if c&1 or (d and c < 2):
    print("NO")
else:
    print("YES")

import math
from collections import defaultdict, Counter, deque

INF = float('inf')

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

def isPrime(n):
	if (n <= 1):
		return False
	i = 2
	while i ** 2 <= n:
		if n % i == 0:
			return False
		i += 1
	return True

def primeFactor(n):
	if n % 2 == 0:
		return 2
	i = 3
	while (i ** 2) <= n:
		if n % i == 0:
			return i
		i += 1
	return n

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

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

def main():
	n = int(input())
	arr = array()
	h = arr.count(100)
	t = arr.count(200)
	f = 0
	s = 0

	while t > 0:
		if f <= s:
			f += 2
		else:
			s += 2
		t -= 1

	while h > 0:
		if f <= s:
			if s - f >= 2 and h > 1:
				f += 1
				h -= 1
			f += 1
		else:
			if f - s >= 2 and h > 1:
				s += 1
				h -= 1
			s += 1

		h -= 1

	if s == f:
		print('YES')
	else:
		print('NO')

if __name__ == "__main__":
	# t = int(input())
	t = 1
	for _ in range(t):
		main()

import sys

input = lambda: sys.stdin.readline().strip("\r\n")

n = int(input())
w = list(map(int, input().split()))
one = w.count(100)
two = w.count(200)
# print(one)
# print(two)
if (one * 0.5 == two) or (two % 2 == 0 and one % 2 == 0) or (two % 2 == 1 and one % 2 == 0 and one >= 2):
    print("YES")
else:
    print("NO")

_, A =input(), list(map(int,input().split()))
if(sum(A)%200 == 0 and (len(A)%2 == 0 or (len(A)%2 == 1 and 100 in A and 200 in A))):
	print("YES")
else:
	print('NO')

n = input()

vals = map(int, raw_input().split())

c1 = 0
c2 = 0

for val in vals:
    if val == 100:
        c1 += 1
    else:
        c2 += 1

def can_sum(a,b,c,d):
    return a+2*b==c+2*d or a+2*d==c+2*b or c+2*d==a+2*b or c+2*b==a+2*d

i = 0
for j in range(c2):
    xt1 = c1-i
    xo1 = i
    xt2 = c2-j
    xo2 = j
    if can_sum(xt1, xt2, xo1, xo2):
        print "YES"
        exit(0)

j = 0
for i in range(c1):
    xt1 = c1-i
    xo1 = i
    xt2 = c2-j
    xo2 = j
    if can_sum(xt1, xt2, xo1, xo2):
        print "YES"
        exit(0)

for i in range(c1):
    xt1 = c1-i
    xo1 = i
    for j in range(c2):
        xt2 = c2-j
        xo2 = j
        if can_sum(xt1, xt2, xo1, xo2):
            print "YES"
            exit(0)

print "NO"

# -*- coding:utf-8 -*-
#[n, m] = [int(x) for x in raw_input().split()]

def some_func():
    """
    """
    n = input()
    n_list = [ int(x) for x in raw_input().split()]
    f1=n_list.count(100)
    f2=n_list.count(200)

    if f2%2==0 and f1%2==0:
        return "YES"
    if f2%2==1 and f1 and f1%2==0:
        return "YES"
    return "NO"

if __name__ == '__main__':
    print some_func()

import sys
from collections import defaultdict, Counter
from math import sin, cos, asin, acos, tan, atan, pi

sys.setrecursionlimit(10 ** 6)

def pyes_no(condition, yes = "YES", no = "NO", none = "-1") :
  if condition == None:
    print (none)
  elif condition :
    print (yes)
  else :
    print (no)

def plist(a, s = ' ') :
  print (s.join(map(str, a)))

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

def rstr() :
  return sys.stdin.readline().strip()

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

def rfield(n, m = None) :
  if m == None :
    m = n

  field = []
  for i in xrange(n) :
    chars = sys.stdin.readline().strip()
    assert(len(chars) == m)
    field.append(chars)
  return field

def pfield(field, separator = '') :
  print ('\n'.join(map(lambda x: separator.join(x), field)))

def check_field_equal(field, i, j, value) :
  if i >= 0 and i < len(field) and j >= 0 and j < len(field[i]) :
    return value == field[i][j]
  return None

def digits(x, p) :
  digits = []
  while x > 0 :
    digits.append(x % p)
    x //= p
  return digits[::-1]

def undigits(x, p) :
  value = 0
  for d in x :
    value *= p
    value += d
  return value

def modpower(a, n, mod) :
  r = a ** (n % 2)
  if n > 1 :
    r *= modpower(a, n // 2, mod) ** 2
  return r % mod

def gcd(a, b) :
  if a > b :
    a, b = b, a

  while a > 0 :
    a, b = b % a, a

  return b

def vector_distance(a, b) :
  diff = vector_diff(a, b)

  return scalar_product(diff, diff) ** 0.5

def vector_inverse(v) :
  r = [-x for x in v]

  return tuple(r)

def vector_diff(a, b) :
  return vector_sum(a, vector_inverse(b))

def vector_sum(a, b) :
  r = [c1 + c2 for c1, c2 in zip(a, b)]

  return tuple(r)

def scalar_product(a, b) :
  r = 0
  for c1, c2 in zip(a, b) :
    r += c1 * c2

  return r

def check_rectangle(points) :
  assert(len(points) == 4)

  A, B, C, D = points

  for A1, A2, A3, A4 in [
    (A, B, C, D),
    (A, C, B, D),
    (A, B, D, C),
    (A, C, D, B),
    (A, D, B, C),
    (A, D, C, B),
  ] :
    sides = (
      vector_diff(A1, A2),
      vector_diff(A2, A3),
      vector_diff(A3, A4),
      vector_diff(A4, A1),
    )
    if all(scalar_product(s1, s2) == 0 for s1, s2 in zip(sides, sides[1:])) :
       return True
  return False

def check_square(points) :
  if not check_rectangle(points) :
    return False
  A, B, C, D = points

  for A1, A2, A3, A4 in [
    (A, B, C, D),
    (A, C, B, D),
    (A, B, D, C),
    (A, C, D, B),
    (A, D, B, C),
    (A, D, C, B),
  ] :
    side_lengths = [
      (first[0] - next[0]) ** 2 + (first[1] - next[1]) ** 2 for first, next in zip([A1, A2, A3, A4], [A2, A3, A4, A1])
    ]
    if len(set(side_lengths)) == 1 :
      return True

  return False

def check_right(p) :
  # Check if there are same points
  for a, b in [
    (p[0], p[1]),
    (p[0], p[2]),
    (p[1], p[2]),
  ] :
    if a[0] == b[0] and a[1] == b[1] :
      return False

  a, b, c = p
  a, b, c = vector_diff(a, b), vector_diff(b, c), vector_diff(c, a)

  return scalar_product(a, b) * scalar_product(a, c) * scalar_product(b, c) == 0

n = rint()
a = Counter(rints())

pyes_no(a[100] % 2 == 0 and (a[100] > 0 or a[200] % 2 == 0))

#coding: utf-8

qtd = int(raw_input())
weight = map(int, raw_input().split())

dicio = {100: 0, 200: 0}

for i in xrange(qtd):
    dicio[weight[i]] += 1

if dicio[100] % 2 != 0:     # 200 nao importa
    ans = "NO"
else:
    if dicio[100] == 0 and dicio[200] % 2 != 0:
        ans = "NO"
    else:
        ans = "YES"

print ans

n = int(raw_input())
a = map(int, raw_input().split())
c1 = 0
c2 = 0
ans = 'YES'
for i in range(n):
  if a[i] == 100:
    c1 += 1
  else:
    c2 += 1
if c1 % 2 == 1: ans = 'NO'
if c1 == 0 and c2 % 2 == 1: ans = 'NO'
print ans

n = int( raw_input() )
w = map( int, raw_input().split() )

w1, w2 = 0, 0

w.sort( reverse = True )

for num in w:
    if ( w1 <= w2 ):
        w1 += num
    else:
        w2 += num

print "YES" if ( w1 == w2 ) else "NO"

n=int(input())
xy=map(int,raw_input().split())
one=0
two=0
for i in xy:
    if i==100:
        one+=1
    else:
        two+=1

if two%2==0:
    if one%2==0:
        print "YES"
    else:
        print "NO"
else:
    san=one*100 + 200
    if san%200==0 and one>0:
        print "YES"
    else:
        print "NO"

a = input()
b = input()

a = int(a)
b = [int(i) for i in b.split(' ')]

c1 = c2 = 0
for i in b:
    if i == 100:
        c1 += 1
    else:
        c2 += 1
c2 %= 2   # 0,1
c1 -= c2 * 2
if c1 < 0 or c1 % 2 == 1:
    print("NO")
else:
    print("YES")

input();a=map(int,raw_input().split());c=sum(a);print'YES'if c%400==0 or (c%200==0 and 100 in a) else'NO'

n = int(input())
a = [int(i) for i in input().split()]
if a.count(200) == n and n % 2 != 0:
  print('NO')
else:
  b = sum(a)
  if b % 200 == 0:
    print('YES')
  else:
    print('NO')

n=int(input())
a=list(map(int,input().split(" ")))
c1=0
c2=0
for i in range(len(a)):
    if a[i]==100:
        c1+=1
    else:
        c2+=1
if c1>0 and c2>0:
    if c1%2==0 and c2%2==0:
        print("YES")
    elif c1%2==0 and c2%2!=0:
        print("YES")
    else:
        print("NO")
if c1==0 and c2>0:
    if c2%2==0:
        print("YES")
    else:
        print("NO")
if c2==0 and c1>0:
    if c1%2==0:
        print("YES")
    else:
        print("NO")

#Author: squiggly_lines
#Date: 31/05/2014
#Problem: 433A

def main():
    n = int(raw_input())
    w = map(int, raw_input().split())

    ec,oc = 0,0
    for apple in w:
        if apple == 200:
            ec += 1
        else:
            oc += 1

    if oc % 2 == 1:
        print "NO"
        return
    if ec % 2 == 1 and oc < 2:
        print "NO"
        return
    print "YES"

if __name__ == "__main__":
    main();

def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())

import math

n=ii()
a=li()
s=sum(a)
b=a.count(100)
if s%400==0:
    print("YES")
else:
    if s%200==0 and b:
        print("YES")
    else:
        print("NO")

a=input()
m=map(int,raw_input().split())
b=list(m)
sum=0
count=0
for i in range(0,a):
    if(b[i]==200):
        count=count+1
    sum=sum+b[i]
if(sum%2==0):
    if(a%2==0):
        if(count%2==0):
            print "YES"
        else :
            print "NO"
    else :
        if(count%2!=0 and count<a):
            print "YES"
        else :
            print "NO"
else :
    print "NO"

n = int(input())
w = [int(x) for x in input().split()]
n1 = 0
for x in w:
    if x==100:
        n1 += 1
n2 = n - n1
n2 = n2%2
n1 -= 2*n2
if n1>=0 and n1%2==0:
    print("YES")
else:
    print("NO")

n = int(input())
A = list(map(int,input().split()))
odd = 0
even = 0
for i in A:
    if i == 100:
        odd += 1
    else:
        even += 1
x = 0
for i in range(odd+1):
    for j in range(even + 1):
        if i + 2*j == (odd - i) + 2*(even - j):
            x = 1
if x == 1:
    print("YES")
else:
    print("NO")

n = int(input())
arr = list(map(int,input().split()))
h = arr.count(100)
t = arr.count(200)
if(n%2==0):
    if(n==h or n==t):
        print("YES")
    elif(h%2==0):
        print("YES")
    else:
        print("NO")
else:
    if(h==0 or t==0):
        print("NO")
    elif(h%2!=0):
        print("NO")
    else:
        print("YES")

def solve(w):
    n = len(w)
    if n < 2: return False
    a, b = w.count(100), w.count(200)
    s = a*100+b*200
    if s % 200 != 0: return False
    t = s/2
    for i in range(0, b+1):
        if 200*i > t: break
        c = (t-200*i)/100
        if c <= a: return True
    return False

n = int(raw_input())
w = map(int, raw_input().split())
print 'YES' if solve(w) else 'NO'

t=int(input())
s=map(int,raw_input().split())
a=sum(s)

if(len(s)==1):
	print "NO"

elif(a%2!=0):
	print "NO"
else:
	first=0
	second=0
	s.sort()
	i=len(s)-1
	while(i>=0):
		if(first>second):
			second+=s[i]
		else:
			first+=s[i]
		i-=1
#	print first,second
	if(first==second):

		print "YES"
	else:
		print "NO"

def equal_apples (apples):
    two_g = 0
    one_g = 0
    for x in apples :
        if x == '200' :
            two_g += 1
        else:
            one_g += 1

    if two_g%2 == 0 :
        if one_g%2 == 0:
           return "YES"
        else:
            return "NO"
    else:
        if one_g < 2 :
            return "NO"
        else:
            one_g -= 2
            if one_g %2 == 0:
                return "YES"
            else:
                return "NO"

n = int(input())
apples = input().split()

print (equal_apples(apples))

x = int(input())
y = list(map(int , input().split()))
o = y.count(100)
t = y.count(200)
if( o%2 == 0 and t%2 == 0 ):
    print("YES")
elif( o == 0 or t == 0):
    print("YNEOS"[(t+o)%2::2])
else:
    print("YNEOS"[abs(o-2*t)%2::2])

n = input()

vals = map(int, raw_input().split())

c1 = 1
c2 = 1

for val in vals:
    if val == 100:
        c1 += 1
    else:
        c2 += 1

def can_sum(a,b,c,d):
    return any(p1+2*p3==p2+2*p4 for p1,p2 in [(a,c), (c,a)] for p3,p4 in [(b,d), (d,b)])

for i in range(c1):
    xt1 = c1-i-1
    xo1 = i
    for j in range(c2):
        xt2 = c2-j-1
        xo2 = j
        if can_sum(xt1, xt2, xo1, xo2):
            print "YES"
            exit(0)

print "NO"

n=int(input())
lst=list(map(int,input().split()))
print(["NO",'YES'][sum(lst)%200==0 and((n%2==1 and 100 in lst  and 200 in lst) or n%2 == 0)])

n = int(raw_input())
w = raw_input().split()

soma = 0
for i in w:
	soma += int(i)

if soma % 200 == 0 and (soma != 200 * n or n % 2 == 0):
	print "YES"
else:
	print "NO"

n = int(input())
lst = list(map(int, input().split()))
od,ev = 0,0
for i in range(len(lst)):
    if lst[i] == 200:
        od += 1
    else:
        ev += 1
if ((not(od % 2)) and (not(ev % 2))) or ((od % 2) and (ev > 1) and (not(ev%2))):
    print('YES')
else:
    print('NO')
#Balamar

input();a=map(int,raw_input().split());c=sum(a);print'YES'if c%400==0 or (c%200==0 and 100 in a) else'NO'

#!/usr/bin/env python3
import sys

if __name__ == "__main__":
	n = int(sys.stdin.readline())
	ais = list(map(int, sys.stdin.readline().split()))
	weights = {100:ais.count(100), 200:ais.count(200)}
	total  = 100*weights[100] + 200*weights[200]
	if (total//100)%2 != 0 or n <= 1:
		print("NO")
	else:
		if weights[200] % 2 == 1 and weights[100] <=0:
			print("NO")
		else:
			print("YES")

__author__ = 'lyric_seraph'

import sys

def main():
    n = raw_input()
    n = int(n)
    num = raw_input()
    num = num.split()
    num = [int(nums) for nums in num]
    cnt = [0, 0]
    for i in num:
        if i == 100:
            cnt[0] += 1
        else:
            cnt[1] += 1
    while cnt[1] > 0:
        if cnt[1] >= 2:
            cnt[1] -= 2
        elif cnt[0] >= 2:
            cnt[1] -= 1
            cnt[0] -= 2
        else:
            break
    while cnt[0] > 0:
        if cnt[0] >= 2:
            cnt[0] -= 2
        else:
            break
    if cnt[0] + cnt[1] > 0:
        print 'NO'
    else:
        print 'YES'

if __name__ == '__main__':
    exit(main())

n=int(input())
c1=input().count('1')
if c1&1:
    print('NO')
elif c1==0 and n&1:
    print('NO')
else:
    print('YES')

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

hundreds = 0
twohundreds = 0
sumw = 0

for apple in apples:
    if apple == 100:
        hundreds += 1
    else:
        twohundreds += 1
    sumw += apple

if n >= 2 and ((twohundreds % 2 == 0 and hundreds % 2 == 0) or (twohundreds % 2 == 1 and hundreds % 2 == 0 and hundreds > 0)):
    print("YES")
else:
    print("NO")

n = input()
arr = input().split()
o = t = 0
for _ in arr:
    if _=='100':o+=1
    else:t+=1
if o%2==0 and t%2==0 or o>1 and t%2 and o%2==0:
    print("YES")
else:print("NO")

n = int(input())

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

n1 = a.count(100)
n2 = n-n1
if n1>0 and n2>0:
    if n2%2 ==0:
        if n1%2==0:
            print("YES")
        else:
            print("NO")
    else:
        if (n1-2)%2==0:
            print("YES")
        else:
            print("NO")
elif n1%2==0 and n2%2==0:
    print("YES")
else:
    print("NO")

n=input()
data=map(int,raw_input().split())
a=data.count(100)
b=data.count(200)
if a%2==1 or (b%2==1 and a==0):
    print 'NO'
else:
    print 'YES'

n = int(raw_input())
w = map(int, raw_input().split())
a = w.count(100)
b = w.count(200)
if a % 2 == 1:
	print "NO"
elif a == 0 and b % 2 == 1:
	print "NO"
else:
	print "YES"

n=input()
w=map(int,raw_input().split())
h,t=w.count(100),w.count(200)
g=sum(w)

if (g/100)%2==1 or n==1:  #geen even honderdtal
    print 'NO'
else:
    d=g/2
    while d>100 and t>0:
        d-=200
        t-=1
    if h*100>=d:
        print 'YES'
    else:
        print 'NO'

n = int(raw_input())
a = map(int,raw_input().split())
f = c1 = c2 = 0

for i in a:
    if i == 100:
        c1 += 1
    else:
        c2 += 1

if c1 % 2 == 0:
    if c2 % 2 == 0:
        f = 1
    elif c1 >= 2 or c1 == c2*2:
        f = 1
if f:
    print 'YES'
else:
    print 'NO'

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

one_hundred = w.count(100)
two_hundred = w.count(200)

if one_hundred % 2 == 1 or (two_hundred % 2 == 1 and one_hundred == 0):
    print('NO')
else:
    print('YES')

# coding: utf-8

n = int(raw_input())
m = map(int, raw_input().split())

if (n==1): print "NO"
else:
    a1, a2, soma = 0, 0, 0
    for weight in m:
        if (weight == 100): a1 += 1
        else: a2 += 1
        soma += weight
    if (a1+a2*2)%2 == 0:
        if (a1==0) and (a2%2!=0): print "NO"
        else: print "YES"
    else: print "NO"

import sys

r = raw_input().split(" ")
n = int(r[0])
r = raw_input().split(" ")
q1 = 0; q2 = 0;
for i in r:
    if i == "100":
        q1 += 1
    else:
        q2 += 1

def calc(q1, q2):
    for i in range(q1+1):
        for j in range(q2+1):
            p1 = i * 100 + j * 200
            p2 = (q1 - i) * 100 + (q2 - j) * 200
            if p1 == p2:
                return True
    return False

if q1 == 0:
    if q2 % 2 == 0:
        print "YES"
    else:
        print "NO"
elif q2 == 0:
    if q1 % 2 == 0:
        print "YES"
    else:
        print "NO"
elif calc(q1,q2):
    print "YES"
else:
    print "NO"

import sys
from collections import Counter
sys.stdin.readline()
apples=[int(x) for x in sys.stdin.readline().split(' ')]
c=Counter(apples)
if c[100]==0 and c[200]%2==0:
    print 'YES'
elif c[100]%2==0 and c[100]!=0:
    print 'YES'
else:
    print 'NO'

n=int(input())
lst=list(map(int,input().split()))
print(["NO",'YES'][sum(lst)%200==0 and((n%2==1 and 100 in lst  and 200 in lst) or n%2 == 0)])

n=int(input())
c1=c2=0
l=[int(x) for x in input().split()]
for i in range(n):
    if(l[i]==100):
        c1+=1
    else:
        c2+=1
if(c1%2==0 and c2%2==0):
    print("YES")
elif(((c1==0 and c2!=0) and c2%2==0)or((c2==0 and c1!=0) and c1%2==0)):
    print("YES")
elif(c1%2==0 and c2%2!=0 and c1!=0):
    print("YES")
else:
    print("NO")

#A. Kitahara Haruki's Gift
n = input()
dic = {100:0,
      200:0}
a = list(map(int,input().split()))
for i in a:
    dic[i]+=1
#case when both are even
if dic[100]%2==0 and dic[200]%2==0:
    print('YES')
elif dic[200]%2!=0 and dic[100]%2==0 and dic[100]>=2 :
    print('YES')
else:
    print('NO')

input();a=map(int,raw_input().split());c=sum(a);print'YES'if c%400==0 or (c%200==0 and 100 in a) else'NO'

n = int(raw_input())
w = map(int, raw_input().split())
d = 0
for i in range(n):
    if w[i] == 200:
        d +=1
if d%2 == 1:
    if (n-d)%2 == 0 and (n-d)>0:
        print "YES"
    else:
        print "NO"
elif (n-d)%2 == 0:
    print "YES"
else:
    print "NO"

from collections import Counter

def main():
    n = int(input())
    c = Counter(input().split())
    print(('YES', 'NO')[c['100'] & 1 if c['100'] else c['200'] & 1])

if __name__ == '__main__':
    main()

n=int(input())
c1=input().count('1')
if c1&1:
    print('NO')
elif c1==0 and n&1:
    print('NO')
else:
    print('YES')

n=int(input())
s=list(map(int,input().split()))
a=sum(s)
s.count(100)
s.count(200)

if (a//2)%100==0:
    if s.count(100)%2==0 and s.count(200)%2==0:
            print('YES')
            exit()

    if s.count(100)>1 and s.count(200)%2==1:
        print('YES')
        exit()

print('NO')

num_apples = int(raw_input())
macas = map(int, raw_input().split())
somatorio = sum(macas)
if num_apples <= 1:
	print 'NO'
elif somatorio % 200 == 0:
	print 'YES'
else:
	print 'NO'

n = int(raw_input())
a = map(int,raw_input().split())
s = 0
for i in a:
    s += i
res = s/2
if res % 100 == 0:
    print 'YES'
else:
    print 'NO'

n = int(input())
a = [int(j) for j in input().split()]
if((sum(a)//2)%100 != 0 or n<=1):
    print('NO')
else:
    s = (sum(a)//2)
    x = a.count(200)
    y = a.count(100)
    ans = 0
    for i in range(x):
        if(s - 200*i >= 0  and s - 200*i >= 100*y):
            ans = 1
    if(ans):
        print('YES')
    else:
        print('NO')

def main():
	n = int(raw_input())
	a = map(int , raw_input().split(' '))
	h,t = 0,0
	for i in a:
		h += i

	h = h>>1
	if h%100 != 0:
		print 'NO'
	else:
		print 'YES'

main()

n = int(input())
a = list(input().split(' '))
a = list(int(x) for x in a)
one, two = 0, 0
for i in range(n):
    if a[i] == 100:
        one += 1
    else:
        two += 1
flag = False
if one%2 == 0 and two%2 == 0 or one > two and (one - two + 1) % 2 == 0 and (one - two + 1) >=2:
    flag = True
if not flag:
    print('NO')
else:
    print('YES')

n=int(input())
a=list(map(int, input().split()))
print(a.count(100))
if ((a.count(100)) % 2) ==0 and n > 1:
    print('YES')
else:
    print('NO')

n=input()
w=map(int,raw_input().split())
h,t=w.count(100),w.count(200)
g=sum(w)
h,t=0,0
if (g/100)%2==1:  #geen even honderdtal
    print 'NO'
else:
    d=g/2
    while d>0 and t>0:
        d-=200
        t-=1
    if h*100>=d:
        print 'YES'
    else:
        print 'NO'

n=int(input())
q=map(int,input().split())
f=list(q)
#print(f)
i=0
w=0
l=len(f)
while i<l:
    y=f[i]
    w=w+y
    i+=1
#print(w)
t=w/2
h=int(t%100)
#print(h)
if h==0:
    print("YES")
else:
    print("NO")

# coding: utf-8
# (C) 2015, Laybson Plismenn / UFCG

n = int(raw_input())
ws = map(int, raw_input().split())

pa = 0
pb = 0

for i in ws:
    if i == 100:
        pa += 1
    else:
        pb += 2

if n % 2 == 0:
    if pa % 2 == 0 and (pb/2) % 2 == 0:
        print "YES"
    else:
        print "NO"
else:
    if n != 1 and pa % 2 == 0 and (pb/2) % 2 != 0:
        print "YES"
    else:
        print "NO"

n = int(raw_input())
count =0
d = raw_input().split()
c = 0
e = 0
for a in d:
	if int(a) == 100:
		c+=1
	else:
		e+=1
if c%2==1:
	print "NO"
if c==0 and e%2==1:
	print "NO"
else:
	print "YES"

n=int(input())
w=list(map(int,input().split()))
if 100 not in w:
    if w.count(200)%2!=0:
        print("NO")
        exit()
elif 200 not in w:
    if w.count(100)%2!=0:
        print("NO")
        exit()
else:
    a=w.count(100)
    b=w.count(200)
    if a%b!=0:
        print("NO")
        exit()
print("YES")

from itertools import permutations

n = int(input())
nums = [int(x) for x in input().split(" ")]

cnt_100 = 0
cnt_200 = 0

for num in nums:
    if num == 100:
        cnt_100 += 1
    else:
        cnt_200 += 1

if cnt_100 % 2 == 0 and cnt_200 % 2 == 0:
    print("YES")
elif cnt_200 % 2 != 0 and cnt_100 % 2 != 0:
    print("NO")
elif cnt_100 < cnt_200 and cnt_100 % 2 != 0 and cnt_200 % 2 == 0:
    print("NO")
elif cnt_100 > cnt_200 and cnt_100 % 2 == 0 and cnt_200 % 2 != 0:
    print("YES")
elif cnt_200 > cnt_100 and cnt_200 % 2 != 0 and cnt_100 % 2 == 0:
    print("YES")
else:
    print("NO")

n=int(input())
a=list(map(int,input().split()))
doso=0
soo=0
s=sum(a)

j=s/100
if(n==1):
    print("NO")
else:
    if(int(j)%2==0):
        print("YES")
    else:
        print("NO")

n = int(raw_input())
count =0
d = raw_input().split()
for a in d:
	if int(a) == "100":
		count+=1
	else:
		count+=2
if count%2==0:
	print "YES"
else:
	print "NO"

# -*- coding: utf-8 -*-
# @Date    : 2020-01-11 07:14:43
# @Author  : Anuj Puri (anujpuri72@gmail.com)
# @Link    : link
# @Version : 1.0.0

import sys
sys.setrecursionlimit(10**5+1)

inf     =  int(10 ** 20)
max_val =  inf
min_val = -inf

RW  = lambda : sys.stdin.readline().strip()
RI  = lambda : int(RW())
RMI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]
RWI = lambda : [x for x in sys.stdin.readline().strip().split()]
n = RI()
l=RMI()
hun=l.count(100)
two=l.count(200)
# print(hun,two)
if(n%2==0):
    if ((hun==two) or (hun==n) or (two ==n)):
        print("YES")
    else:
        print("NO")
else:
    if(hun==(2*two)):
        print("YES")
    else:
        print("NO")

n = input()
apples = sorted(map(int, raw_input().strip().split()))

sap = sum(apples)/2
s = max(apples)
for i in xrange(n-1):
    if s == sap:
        print 'YES'
        break
    if s > sap:
        print 'NO'
        break
    else:
        s += apples[i]

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

t=0

for i in range(len(l)):
     if l[i]==l[0] and n%2!=0:
        t=-1
     else:
          if l[i]==100:
               t+=1
          elif l[i]==200:
               t+=2
if t%2==0:
     print('YES')
elif t==-1:
     print('NO')
else:
     print('NO')

def f(A):
    if sum(A)/100 % 2 == 0:
        return "YES"
    return "NO"

n = input()
arr = [int(i) for i in raw_input().strip().split()]
print f(arr)

n=int(input())
i=0
l=0
m=0
p=0
q=3
x=raw_input()
while i<n:
  list(x)
  y= int(x[p:q])
  p=p+4
  q=q+4
  if y==100:
    l=l+1
  else:
    m=m+1
  i=i+1

t=100*l + 200*m
if t%200==0:
  print "YES"
else:
  print "NO"

length = int(input())
weights = list(map(int, input().split()))
ones = [x for x in weights if x == 100]
twos = [x for x in weights if x == 200]
if not ones or not twos:
    if length % 2 == 0:
        print('YES')
    else:
        print('NO')
else:
    if len(ones) == 2 * len(twos):
        print('YES')
    else:
        print('NO')

n = int(input())
a = [int(i) for i in input().split()]
ones = 0
twos = 0
for i in a:
    ones += int(i == 100)
    twos += int(i == 200)
ans = 'NO'
if (((ones * 100 + twos * 200) / 2) % 100 == 0):
    if (ones >= twos):
        if ((ones - twos) % 2 == 1):
            ans = 'YES'
    else:
        if (((ones / 2) % 1 == 0 and ones / 2 >= (twos % 2))):
            ans = 'YES'
print (ans)

a,b = 0,0
n = int(input())
x1 = list(map(int,input().split()))
for x in x1:
    if x == 100:
        a = a+1
    else:
        b = b+1

sum = 100 * a + 200 * b
if sum % 200 != 0:
    print("NO")
else:
    half = sum / 2
    ans = False
    for i in range(b):
        if (200 * i <= half and half - 200 * i <= a * 100):
            ans = True
    if ans:
        print("YES")
    else:
        if len(x1)>1 and len(set(x1))==1:
            print("YES")
        else:
            print("NO")

n = int(input())
w = [int(i) for i in input().split()]
a,b=0,0
for i in w:
	if i == 100:
		a += 1
	else:
		b += 1
if(a==0 or b==0):
	n = a if b==0 else b
	print("YES" if (a|b)%2==0 else "NO")
else:
	if(a*100==b*200):
		print("YES")
	else:
		print("NO")

t=int(input())
s=map(int,raw_input().split())
a=sum(s)
a/=2
if(len(s)==1):
	print "NO"

else:
	first=0
	second=0
	for x in s:
		if(first>second):
			second+=x
		else:
			first+=x
	if(first==second):
		print "YES"
	else:
		print "NO"

n = int(raw_input())
a,b=0,0
l=map(int,raw_input().split())
for x in l:
    if x==100:
        a+=1
    else:
        b+=1

if a&1:
    print 'NO'

elif b&1:
    if a>=2:
        print 'YES'

n=int(input())
arr=[int(x) for x in input().split(' ')]
half=sum(arr)//2
prefix=[0]
for item in arr:
	prefix.append(prefix[-1]+item)
if half in prefix:
	print("YES")
else:
	print("NO")

def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def li(): return list(mi())

import math

n=ii()
a=li()
s=0
for i in a:
    if i==100:
        s+=1
    else:
        s+=2
if s%2 or n==1:
    print("NO")
else:
    print("YES")

n=int(input())
l=input().split()
s=0
for i in range(n):
    l[i]=int(l[i])//100
    s+=l[i]
if(s%2!=0 or n==1):
    print("NO")
else:
    print("YES")

from collections import Counter
n=int(input())
l=list(input().split())
c=Counter(l)
if c['100']%2==0 and c['200']%2==0:
    print("YES")
elif c['100']%2==0 and c['200']%2!=0 and 100*c['100']>=200*c['200']:
    print("YES")
else:
    print("NO")

n=int(input())
w=sum(map(int,input().split()))
if w%200==0:print('YES')
else:print('NO')

n = int(input())
A = [int(x)for x in input().split()]
suma = 0
if (n < 2):
    print("NO")
else:
    for k in range(len(A)):
        suma+=A[k]
    r = suma//2
    if ((suma == 100)or(suma == 200)):
        print("YES")
    else:
        if (((r%100)==0)and((r%200)==0)):
            print("YES")
        else:
            print("NO")

#!/usr/bin/env pypy
from __future__ import division, print_function
from collections import defaultdict, Counter, deque
from future_builtins import ascii, filter, hex, map, oct, zip
from itertools import imap as map, izip as zip, permutations, combinations, combinations_with_replacement
from __builtin__ import xrange as range
from math import ceil, factorial
from _continuation import continulet
from cStringIO import StringIO
from io import IOBase
import __pypy__
from bisect import bisect, insort, bisect_left, bisect_right
from fractions import Fraction
from functools import reduce
import string
import sys
import os
import re
inf = float('inf')
mod_ = int(1e9) + 7
mod = 998244353

def factors(n):
    from functools import reduce
    return set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))

def sieve():
    n,m=1,10**6
    primes = {}
    arr=set([])
    for i in range(2, round(m ** 0.5) + 1):
        a = n // i
        b = m // i
        for k in range(max(2, a), b + 1):
            c = i * k
            primes[c] = 1

    for i in range(max(n, 2), m + 1):
        if i not in primes:
            arr.add(i)

    return arr

def nc2(x):
    return (x*(x-1))//2
def main():
    n=int(input())
    arr=list(map(int,input().split()))
    if sum(arr)%200==0 and n>1:
        print("YES")
    else:
        print("NO")

# region fastio

BUFSIZE = 8192

class FastI(IOBase):
    def __init__(self, file):
        self._fd = file.fileno()
        self._buffer = StringIO()
        self.newlines = 0

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count("\n") + (not b)
            ptr = self._buffer.tell()
            self._buffer.seek(0, 2), self._buffer.write(b), self._buffer.seek(ptr)
        self.newlines -= 1
        return self._buffer.readline()

class FastO(IOBase):
    def __init__(self, file):
        self._fd = file.fileno()
        self._buffer = __pypy__.builders.StringBuilder()
        self.write = lambda s: self._buffer.append(s)

    def flush(self):
        os.write(self._fd, self._buffer.build())
        self._buffer = __pypy__.builders.StringBuilder()

def print(*args, **kwargs):
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()

def gcd(x, y):
    while y:
        x, y = y, x % y
    return x

sys.stdin, sys.stdout = FastI(sys.stdin), FastO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

n=int(input())
c=list(map(int,input().split()))
if c.count(100)%2!=0 or n==1: print('NO')
else: print('YES')

n = int(input())
w = [int(x) for x in input().split()]
n1 = 0
for x in w:
    if x==100:
        n1 += 1
n2 = n - n1
n2 = n2%2
if n1>=2 or n1==0:
    n1 -= 2
    n1 = n1%2
    if n1==0:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

x=int(raw_input())
y=map(int, raw_input().split())
ans=y[0]
ans2=0
for i in range(1,x,1):
  if ans > ans2:
    ans2+=y[i]
  else:
    ans+=y[i]
if ans == ans2:
  print 'YES'
else:
  print 'NO'

#input
n = int(input())
apples = [int(string) for string in input().split()]
#
big_count = apples.count(200)
small_count = apples.count(100)
half = sum(apples) // 2
apples = sorted(apples, reverse = True)
#
if half % 100 > 0:
    print("NO")
else:
    print("YES")

n = input()
arr = input().split()
one = two = 0
for _ in arr:
    if _ == '100':one+=1
    else:two+=1
if one%2==0 and ((one//2)+two)%2==0:print("YES")
elif two%2==0 and one==0:print("YES")
elif one%2==0 and two==0:print("YES")
else:print("NO")

n=int(input())
p=input()
p=list(map(int,p.split()))
c,d,s=0,0,0
for i in p:
    if i==100:
        c+=1
    else:
        d+=1
    s+=i
if s%200==0 and (c>1 or d>1):
    print('YES')
else:
    print('NO')

length = int(input())
weights = list(map(int, input().split()))
ones = [x for x in weights if x == 100]
twos = [x for x in weights if x == 200]
if not ones or not twos:
    if length % 2 == 0:
        print('YES')
    else:
        print('NO')
else:
    if len(ones) == 2 * len(twos) or (len(ones) % 2 == 0 and len(twos) % 2 == 0) or (len(ones) % 2 == 0 and (len(ones) // 2 + len(twos)) % 2 == 0):
        print('YES')
    else:
        print('NO')

_, a = input(), list(input().split())
print('YES'
		if(a.count("100")/2 == a.count("200"))
	else 'NO')

n=int(input())
s=input().split()
c1=s.count('100');c2=n-c1
print('YES'if c1 and c2 and c1==2*c2 or not c1%2 and not c1%2 or not c1 and not c2%2 or not c2 and not c1%2 else 'NO')

t=int(input())
s=map(int,raw_input().split())
a=sum(s)
a/=2
if(len(s)==1):
	print "NO"

else:
	first=0
	second=0
	s.sort()
	for x in s:
		if(first>second):
			second+=x
		else:
			first+=x
#	print first,second
	if(first==second):

		print "YES"
	else:
		print "NO"

n=int(input())

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

s=sum(L)

if(s%200==0):
    print("YES")
else:
    print("NO")

def solve(w):
    n = len(w)
    if n < 2: return False
    s = sum(w)
    if s % 200 != 0: return False
    t = s/2
    a, b = w.count(100), w.count(200)
    for i in range(b+1):
        if (a-(t-200*i)/100)*100 == t: return True
    return False

n = int(raw_input())
w = map(int, raw_input().split())
print 'YES' if solve(w) else 'NO'

n=int(input())
L=[int(i) for i in input().split()]
if n%2==1 and L.count(100)!=2*L.count(200):
    print("NO")
else:
    if (L.count(100)==2*L.count(200)) or (L.count(200)==n) or (L.count(100)==n):
        print("YES")
    else:
        print("NO")

n = input()
arr = input().split()
one = two = 0
for _ in arr:
    if _ == '100':one+=1
    else:two+=1
if one%2==0 and (one//2)==two:print("YES")
elif two%2==0 or one%2==0:print("YES")
else:print("NO")

if __name__ == '__main__':
    n = int(input())
    line = str(input()).split()
    line = [int(it) for it in line]
    value = sum(line) % 200
    if value > 0:
        print('NO')
    else:
        print('YES')

n = int(input())
weights = input().split()
weights = [int(w) for w in weights]

if sum(weights) % 200 == 0 and len(weights) > 1 and len(weights) % 2 == 0:
    print('YES')
else:
    print('NO')

n = int(input())
arr = map(int, input().split())
c = d = 0

for x in arr:
    if x == 100:
        c+=1
    else:
        d+=1

if c%2 == 0 and d%2 == 0:
    print("YES")
elif c%2 == 0 and (d+c/2)%2 == 0:
    print("YES")
else:
    print("NO")

n= int(input())
ans = sorted(list(map(int,input().split())))
result = ((2* ans.count(200)) %2) -  (ans.count(100))%2
print("NYOE S"[result == 0 ::2])

n=int(input())
apple = [int(x) for x in input().split(' ')]
s=sum(apple)
if len(apple)==1:
    print("NO")
elif s%200 !=0:
    print("NO")
elif s==len(apple)*200:
    print("NO")
else:
    print("YES")

n = input()

vals = map(int, raw_input().split())

c1 = 0
c2 = 0

for val in vals:
    if val == 100:
        c1 += 1
    else:
        c2 += 1

i = 0
for j in range(c2):
    xt1 = c1-i
    xo1 = i
    xt2 = c2-j
    xo2 = j
    if xt1+2*xt2 == xo1+2*xo2:
        print "YES"
        exit(0)

j = 0
for i in range(c1):
    xt1 = c1-i
    xo1 = i
    xt2 = c2-j
    xo2 = j
    if xt1+2*xt2 == xo1+2*xo2:
        print "YES"
        exit(0)

for i in range(c1):
    xt1 = c1-i
    xo1 = i
    for j in range(c2):
        xt2 = c2-j
        xo2 = j
        if xt1+2*xt2 == xo1+2*xo2:
            print "YES"
            exit(0)

print "NO"

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

if (a.count(200) + a.count(100)%2 )%2==0 and a.count(100)%2==0:
    print('YES')
else:
    print('NO')

n = int(input())
lst = list(map(int, input().split()))
touma = 0
ogiso = 0
newlst = lst.copy()
y = int(sum(lst)/2)

for item in lst:
    if touma + item <= y:
        touma = touma + item
        newlst.remove(item)
        continue
    if ogiso + item <= y:
        ogiso = ogiso + item
        newlst.remove(item)
if touma == ogiso and len(newlst) == 0 or touma == ogiso and sum(newlst) % 100 == 0:
    print('YES')
else:
    print('NO')

n=int(input())
w=[int(x) for x in input().split()]
a=w[0]
if n<=1:
    b=0
else:
    b=w[1]
for i in range(2,n):
    if a<b:
        a+=w[i]
    else:
        b+=w[i]
if a==b:
    print("YES")
else:
    print("NO")

n=int(input())
w=sum(map(int,input().split()))
if w%200==0:print('YES')
else:print('NO')

n = int(input())
w = list(map(int,input().split()))
c100,c200=0,0
for e in w:
    if e==100:
        c100+=1
    else:
        c200+=1
if c100==0 or c200==0:
    if n%2==0:
        print("YES")
    else:
        print("NO")
else:
    if c100==c200*2:
        print("YES")
    else:
        print("NO")

n=int(input())
a=list(map(int,input().split()))
doso=0
soo=0
s=sum(a)

j=s/100
if(n==1):
    print("NO")
else:
    if(int(j)%2==0):
        print("YES")
    else:
        print("NO")

n=int(input())
c1=c2=0
l=[int(x) for x in input().split()]
for i in range(n):
    if(l[i]==100):
        c1+=1
    else:
        c2+=1
if(c1%2==0 and c2%2==0):
    print("YES")
elif(((c1==0 and c2!=0) and c2%2==0)or((c2==0 and c1!=0) and c1%2==0)):
    print("YES")
elif(c1%2==0 and c2%2!=0):
    print("YES")
else:
    print("NO")

n=int(input())
w=list(map(int,input().split()))
s=sum(w)
h=0
t=0
for i in w:
    if i==100:
        h+=1
    else:
        t+=1
if (t==0 and h%2==0) or (h==0 and t%2==0) or (h==1 or t==1):
    print('YES')
else:
    if h%2!=0:
        print('NO')

    else:
        while t!=0 and h!=0:
            h-=2
            t-=1
        print("YES")

n = int(raw_input())
w = map(int, raw_input().split())
d = 0
for i in range(n):
    if w[i] == 200:
        d +=1
if d%2 == 1:
    if (n-d)%2 == 0 and (n-d)>0:
        print "YES"
    else:
        print "NO"
elif (n-d)%2 == 0:
    print "YES"

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

if ((a.count(100)) % 2) ==0 and n > 1:
    print('YES')
else:
    print('NO')

import sys
import math

n = int(sys.stdin.readline())
wn = [int(int(x) / 100) for x in (sys.stdin.readline()).split()]

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

# Author: SaykaT
# Problem: 433A
# Time Created: August 02(Sunday) 2020 || 04:08:59

#>-------------------------<#
import sys

input = sys.stdin.readline
#>-------------------------<#

# Helper Functions. -> Don't cluster your code.

# IO Functions. -> Input output
def io():
    n = int(input())
    ls = list(map(int, input().split()))

    return n, ls

# Main functions. -> Write the main solution here
def solve():
    n, ls = io()

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

# Multiple test cases. -> When you have T test cases.
solve()

num_apple=int(input())
weight=input().split()
count1=0
count2=0
i=0
while i<len(weight):
    if '100' == weight[i]:
        count1+=1
    i+=1
j=0
while j<len(weight):
    if '200' == weight[j]:
        count2+=1
    j+=1
if ((200*count2)%(100*count1))==0:
    print("YES")
else:
    print("NO")

n = int(input())
arr = [int(i) for i in input().split()]

count = [0, 0]
for i in arr:
    count[i//100 - 1] += 1

#print(count[0] + count[1]*2)
if not count[0]% 2 and (count[1]%2==0 or (count[0]//2)%2 == 0):
    print('YES')
else:
    print('NO')

t=int(input())
a=list(map(int,input().split(" ")))
b=a.count(100)
c=a.count(200)
if b==c:
    if b%2==0:
        print("YES")
    else:
        print("NO")
elif b>c:
    if (b-c)%2!=0:
        print("YES")
    else:
        print("NO")
else:
    if b%2==0:
        print("YES")
    else:
        print("NO")

n=int(input())
c1=c2=0
l=[int(x) for x in input().split()]
for i in range(n):
    if(l[i]==100):
        c1+=1
    else:
        c2+=1
if(c1%2==0 and c2%2==0):
    print("YES")
elif(((c1==0 and c2!=0) and c2%2==0)or((c2==0 and c1!=0) and c1%2==0)):
    print("YES")
elif(c1%2==0 and c2%2!=0 and c2!=0):
    print("YES")
else:
    print("NO")

n = int(input())
w = list(map(int, input().split()))
if (sum(w)//100) % 2 == 0:
    print('YES')
else:
    print('NO')

#input
n = int(input())
apples = [int(string) for string in input().split()]
#
big_count = apples.count(200)
small_count = apples.count(100)
half = sum(apples) // 2
apples = sorted(apples, reverse = True)
#
if half % 100 > 0:
    print("NO")
else:
    print("YES")

n, a, left, right = raw_input(), map(int, raw_input().split()), 0, 0

left = a.count(100)
right = a.count(200)

if left == 0 and right == 0:
    print "NO"
else:
    if right % 2 == 0 and left % 2 == 0 and int(n) > 1:
        print "YES"
    else:
        if right % 2 == 1 and left % 2 == 0 and int(n) > 1:
            print "YES"
        else:
            print "NO"

n = int(input())
lis = list(map(int,input().split()))
hun = 0
thun = 0
for i in lis:
    if i == 100:
        hun+=1
    else:
        thun+=1
if thun == 0 or hun == 0:
    if thun == 0:
        if hun%2 == 0:
            print ('YES')
        else:
            print ('NO')
    else:
        if thun%2 == 0:
            print ('YES')
        else:
            print ('NO')
elif hun//thun%2 == 0:
    print ('YES')
else:
    print ('NO')

n = int(input())
lis = list(map(int,input().split()))
hun = 0
thun = 0
for i in lis:
    if i == 100:
        hun+=1
    else:
        thun+=1
if thun == 0 or hun == 0:
    if thun == 0:
        if hun%2 == 0:
            print ('YES')
        else:
            print ('NO')
    else:
        if thun%2 == 0:
            print ('YES')
        else:
            print ('NO')
elif hun/thun%2 == 0:
    print ('YES')
else:
    print ('NO')

input ()
print 'YES' if (sum (map (int , raw_input ().split ())) / 100) % 2 == 0 else 'NO'

n=int(input())
s=list(map(int,input().split()))
a=sum(s)
if (a//2)%100==0:
    if s.count(100)%2==0 and (s.count(200)==0 or s.count(200)%2==0):
        print('YES')
else:
    print('NO')

 # -*- coding: utf-8 -*-
'''
Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.

Each apple weights 100 grams or 200 grams. Of course Kitahara Haruki doesn't want to offend any of his friend. Therefore the total weight of the apples given to Touma Kazusa must be equal to the total weight of the apples given to Ogiso Setsuna.

But unfortunately Kitahara Haruki doesn't have a knife right now, so he cannot split any apple into some parts. Please, tell him: is it possible to divide all the apples in a fair way between his friends?

Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of apples. The second line contains n integers w1, w2, ..., wn (wi = 100 or wi = 200), where wi is the weight of the i-th apple.

Output
In a single line print "YES" (without the quotes) if it is possible to divide all the apples between his friends. Otherwise print "NO" (without the quotes).
'''

raw_input()
apples=[int(a) for a in raw_input().split()]
one=apples.count(100)
two=apples.count(200)

if one%2 != 0:
    print 'NO'
elif two>1 and one>1:
    print 'YES'
else:
    print 'NO'

n=int(input())
p=input()
p=list(map(int,p.split()))
c,d,s=0,0,0
for i in p:
    if i==100:
        c+=1
    else:
        d+=1
    s+=i
if c%2==0:
    if c==0:
        if d%2==0:
            print('YES')
    else:
        print('YES')
else:
    print('NO')

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

n = int(raw_input())
count =0
d = raw_input().split()
for a in d:
	if a == "100":
		count+=1
	else:
		count+=2
if count%2==0:
	print "YES"
else:
	print "NO"

a,b = 0,0
n = int(input())
x1 = list(map(int,input().split()))
for x in x1:
    if x == 100:
        a = a+1
    else:
        b = b+1

sum = 100 * a + 200 * b
if sum % 200 != 0:
    print("NO")
else:
    half = sum / 2
    ans = False
    for i in range(b):
        if (200 * i <= half and half - 200 * i <= a * 100):
            ans = True
    if ans:
        print("YES")
    else:
        if len(x1)>1 and x1[0]==x1[1]:
            print("YES")
        else:
            print("NO")

n = input()
print "YES" if str(sum(list(map(int, raw_input().split()))))[0] in "2468" else "NO"

input()
a = sum([int(i) for i in input().split()])
if a % 200 == 0:
  print('YES')
else:
  print('NO')

n=int(input())
i=0
l=0
m=0
p=0
q=3
x=raw_input()
while i<n:
  list(x)
  y= int(x[p:q])
  p=p+4
  q=q+4
  if y==100:
    l=l+1
  else:
    m=m+1
  i=i+1

t=100*l + 200*m
if t%200==0:
  print "YES"
else:
  print "NO"

n=int(raw_input())
l=[int(x)/100 for x in raw_input().split()]
ans=chk=0
t=sum(l)
if t%2:
    print 'NO'
else:
    print 'YES'

import sys

n = sys.stdin.readline()
inputStr = sys.stdin.readline()

weights = inputStr.split(' ')
totalWeight = 0

for weight in weights:
    totalWeight += int(weight)

if totalWeight % 200 == 0:
    if totalWeight / len(weights) != 200:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

n=int(input())
p=input()
p=list(map(int,p.split()))
c,d,s=0,0,0
for i in p:
    if i==100:
        c+=1
    else:
        d+=1
    s+=i
if s%200==0:
    print('YES')
else:
    print('NO')

__author__ = 'lyric_seraph'

import sys

def main():
    n = raw_input()
    n = int(n)
    num = raw_input()
    num = num.split()
    num = [int(nums) for nums in num]
    cnt = [0, 0]
    for i in num:
        if i == 100:
            cnt[0] += 1
        else:
            cnt[1] += 1
    if ((cnt[0] & 1) == 0 and (cnt[1] & 1) == 0) or \
            (cnt[0] - cnt[1] * 2 >= 0 and ((cnt[0] - cnt[1] * 2) & 1) == 0):
        print 'YES'
    else:
        print 'NO'

if __name__ == '__main__':
    exit(main())

__author__ = 'lyric_seraph'

import sys

def main():
    n = raw_input()
    n = int(n)
    num = raw_input()
    num = num.split()
    num = [int(nums) for nums in num]
    cnt = [0, 0]
    for i in num:
        if i == 100:
            cnt[0] += 1
        else:
            cnt[1] += 1
    print cnt
    if cnt[0] % 2 == 1:
        print 'NO'
    else:
        if ((cnt[0] & 1) == 0 and (cnt[0] & 1) == 0):
            print 'YES'
        elif cnt[0] >= cnt[1] * 2:
            print 'YES' if (cnt[0] - cnt[1] * 2) % 2 == 0 else 'NO'
        else:
            print 'YES' if (cnt[1] * 2 - cnt[0]) % 4 == 0 else 'NO'

if __name__ == '__main__':
    exit(main())

n= int(input())
ans = sum(list(map(int,input().split())))//100
print("NYOE S"[ans%2 == 0::2])

n=int(input())
a=list(map(int,input().split()))
x,y=0,0
for i in range(n):
    if a[i]==100:
        x+=1
    else:
        y+=1
if x%2==0 or x==0 and y%2==0:
    print('YES')
else:
    print('NO')

n = input()

a = map(int,raw_input().split())

d = dict()

d[100]=0
d[200]=0

for i in a:
 if i in d:
  d[i]+=1
 else:
  d[i]=1

while d[100]>2:
 d[200]+=1
 d[100]-=2

print d
if d[200]%2==0 and d[100]%2==0:
 print "YES"
else:
 print "NO"

def go():
    n = int(input())
    a = [int(i) for i in input().split(' ')]
    two = a.count(200)
    one = a.count(100)
    if one % 2 == 1:
        return 'NO'
    if two % 2 == 1 and one % 2 == 1:
        return 'NO'
    return 'YES'

print(go())