#include <bits/stdc++.h>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
using namespace std;
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define ll long long 
#define P pair<ll,ll>
const ll inf=1LL << 60;
ll n;
string ans;
void dfs(vector<ll> &a,ll pa,ll pb,ll pc,int i){
  if(i==n){
    if(pa==pb && pb==pc){
      ans="Yes";
    }
    return;
  }
  dfs(a,pa+a.at(i),pb,pc,i+1);
  dfs(a,pa,pb+a.at(i),pc,i+1);
  dfs(a,pa,pb,pc+a.at(i),i+1);
} 
int main(){
  cin >> n;
  vector<ll> a(n);
  rep(i,n){
    cin >> a.at(i);
  }
  ans="No";
  dfs(a,0,0,0,0);
  cout<< ans;
}