#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
#define popcount __builtin_popcount

const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;

ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

int main() {
  ll N; cin >> N;
  ll E[N]; rep(i,N) cin >> E[i];
  string result = "No";
  rep(i,pow(3,N)) {
    ll ti = i;
    vector<ll> abc(N); rep(i,N) { abc[i] = ti%3; ti/=3; } 
    ll a = 0, b = 0, c = 0;
    rep(j,N) {
      if (abc[j]==0) a += E[j];
      else if (abc[j]==1) b += E[j];
      else c += E[j];
      if (a==b&&b==c) result = "Yes";
    }
  }
  cout << result << endl;
  return 0;
}