from heapq import *

N = int(input())
A = list(map(int, input().split()))
p, m = [], []
for a in A:
    if a > 0:
        heappush(p, a)
    elif a < 0:
        heappush(m, -a)
        
while p and m:
    p0 = heappop(p)
    m0 = heappop(m)
    if p0 == m0:
        continue
    if p0 > m0:
        heappush(p, p0 - m0)
    else:
        heappush(m, m0 - p0)
        
if len(p) + len(m) <= 1:
    print("Yes")
else:
    print("No")