import sys
import math
from collections import deque,Counter
#sys.setrecursionlimit(10**7)
int1=lambda x: int(x)-1

mi=lambda :map(int,input().split())
li=lambda :list(mi())
mi1=lambda :map(int1,input().split())
li1=lambda :list(mi1())
mis=lambda :map(str,input().split())
lis=lambda :list(mis())

from collections import defaultdict
"""
d=defaultdict(int) #初期値 0
d=defaultdict(lambda:1) #初期値 1
"""

mod=10**9+7
Mod=998244353
INF=10**18
ans=0


n=int(input())
a=li()
import itertools

all = itertools.product([0,1,2], repeat=n)
for x in all:
  c=[0,0,0]
  for i in range(n):
    c[x[i]]+=a[i]
  if c[0]==c[1]==c[2]:
    print('Yes')
    exit()
print('No')