import sys
sys.setrecursionlimit(10**8)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
N = int(input())
E = list(map(int, input().split()))
sumE = sum(E)
if sumE%3 != 0:
    exit(print('No'))
oneclass = sumE//3

ans = 'No'
def dfs(done:list, team, total):
    global ans

    if ans == 'Yes':
        return

    if team == 2:
        ans = 'Yes'
        return

    for i in range(N):
        if done[i] == 0:
            if total + E[i] == oneclass:
                done[i] = 1
                dfs(done, team + 1, 0)
                done[i] = 0
            elif total + E[i] < oneclass:
                done[i] = 1
                dfs(done, team, total + E[i])
                done[i] = 0
            # オーバーするなら遷移しない

dfs([0]*N, 0, 0)
print(ans)