#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
//using mint = modint998244353;
//std::chrono::time_point<std::chrono::steady_clock> start;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll a, ll b){return a * b / gcd(a, b);}
template<class T, class U>
//contain(string s,string v) sにvが含まれるかを判定
bool contain(const std::basic_string<T>& s, const U& v) {
   return s.find(v) != std::basic_string<T>::npos;
}
std::chrono::time_point<std::chrono::steady_clock> start;
//解説見た
ll kaisu[20];
int main(){
  ll n;
  cin>>n;
  vector<ll>e(n);
  rep(i,n)cin>>e[i];
  kaisu[0]=1;
  for(int i=1;i<=n;i++)kaisu[i]=3*kaisu[i-1];
  rep(i,kaisu[n]){
    int bit[12];
    rep(j,n)bit[j]=i/kaisu[j]%3;
    int sum1=0,sum2=0,sum3=0;
    rep(j,n){
      if(bit[j]==0)sum1+=e[j];
      else if(bit[j]==1)sum2+=e[j];
      else sum3+=e[j];
    }
    if(sum1==sum2&&sum2==sum3){
      cout<<"Yes"<<endl;
      return 0;
    }
  }
  cout<<"No"<<endl;
  return 0;
}