n = int(input())
e = list(map(int,input().split()))
ans = "No"
def dfs(k,l):
    global ans,n
    if k == n:
        if sum(l[0]) == sum(l[1]) == sum(l[2]):
            ans = "Yes"
        return
    for i in [0,1,2]:
        l[i][k] += e[k]
        dfs(k + 1,l[::])
        l[i][k] -= e[k]
l = [[0] * n for _ in range(3)]
dfs(0,l[::])
print(ans)