import sys
from collections import deque, defaultdict,Counter
from copy import deepcopy
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement,accumulate
from functools import reduce
from math import gcd, sin, cos, tan, asin, acos, atan, degrees, radians, ceil, floor, log, sqrt, ceil, floor, pi, hypot
from string import ascii_lowercase
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
sys.setrecursionlimit(1000000)
INF = 10**12
MOD = 10**9+7
# MOD = 998244353
yes="Yes"
no="No"
#|
from random import randint
def II():return int(input())
def SI():return str(input())
def MI():return map(int,input().split())
def MS():return map(str,input().split())
def LI():return list(map(int,input().split()))
def SLI():return sorted(list(map(int,input().split())))
def LS():return list(map(str,input().split()))
def base10int(value, base):
    if (int(value / base)):
        return base10int(int(value / base), base) + str(value % base)
    return str(value % base)
n=II()
e=LI()
for i in range(3**n):
  A=0
  B=0
  C=0
  a=base10int(i,3)
  la=len(a)
  for j in range(la):
    if int(a[j])%3==0:
      A+=e[j]
    elif int(a[j])%3==1:
      B+=e[j]
    else:
      C+=e[j]
  if A==B and B==C:
    print("Yes")
    exit()
print("No")