// #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rep1(i, n) for(long long i = 1; i <= (n); i++)
#define all(v) v.begin(),v.end()
#define decimal(n) cout << fixed << setprecision(n);
using namespace std; 
using namespace atcoder;
using ll = long long; using vl = vector<ll>; using P = pair<ll,ll>;
using vvl = vector<vl>; using vc = vector<char>; using vvc = vector<vc>;
using mint = modint998244353;
// using mint = modint1000000007;
const ll MOD = 998244353;
const ll MAX = 2000100; const ll inf = 3e18; const long double pi = acos(-1);
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll lcm(ll a,ll b){ return (a*b) / gcd(a,b); }

// DFSで長さnの0,1,2列を全て生成するコード
// 3^n 通りの全探索ができる
 
ll n;
vl v;
vl e;
bool flag;
 
void check(vl &v) {
    ll a = 0, b = 0, c = 0;
    rep(i, n){
      if(v[i] == 0) a += e[i];
      else if(v[i] == 1) b += e[i];
      else c += e[i];
    }

    if(a == b and b == c) flag = true;
}
 
void dfs(ll depth) {
    if(depth == n) {
        check(v);
        return;
    }
    rep(i,3){  // ここの数字を2からaに変更すると (a+1)^n 通りの全探索ができる
        v[depth] = i;
        dfs(depth + 1);
    }
}

int main(){
  cin >> n; v.resize(n); e.resize(n);
  rep(i, n) cin >> e[i];

  dfs(0);

  cout << ( flag ? "Yes" : "No") << endl; 
  
}