N = int(input())
E = list(map(int, input().split()))

import sys

sys.setrecursionlimit(100000)

data = [0, 0, 0]
result = 0
def dfs(i, j):
    global result, N
    if i == N:
        if data[0] == data[1] == data[2] == sum(E) // 3:
            result += 1
        return
    num = E[i]
    data[j] += num
    if data[j] > sum(E) // 3:
        data[j] -= num
        return
    for k in range(3):
        dfs(i+1, k)
    data[j] -= num

for i in range(3):
    dfs(0, i)
if result:
    print('Yes')
else:
    print('No')