from heapq import*
n,*a=map(int,open(0).read().split())
p=[]
q=[]
for i in a:
  if 0<=i:
    heappush(p,i)
  else:
    heappush(q,-i)
while (p and q)or(len(p)>1 and p[0]==0):
  # print(p,q)
  if q:
    i,j=heappop(p),-heappop(q)
  else:
    i,j=heappop(p),heappop(p)
  # print(i,j)
  nxt=i+j
  if nxt>=0:
    heappush(p,nxt)
  else:
    heappush(q,-nxt)
if len(p)+len(q)==1:
  print('Yes')
else:
  print('No')