import heapq

N = int(input())
A = list(map(int, input().split()))
P = []
M = []
for a in A:
    if a<0:
        M.append(-a)
    if a>0:
        P.append(-a)
heapq.heapify(P)
heapq.heapify(M)
while len(P) and len(M):
    v = -heapq.heappop(P)-heapq.heappop(M)
    if v>0:
        heapq.heappush(P,-v)
    if v<0:
        heapq.heappush(M,-v)

if len(P)+len(M)>1:
    print('No')
else:
    print('Yes')