#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
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 (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
V<ll> e;
int n;
ll ans;
void solve(int id,ll a,ll b,ll c){
        if(id==n){
              if(a==b&&b==c){
                    cout<<"Yes"<<"\n";
                    exit(0);
              }
              return ;
        }
        solve(id+1,a+e[id],b,c);
        solve(id+1,a,b+e[id],c);
        solve(id+1,a,b,c+e[id]);
}
int main(){
      cin>>n;
      ans=0;
      e.resize(n);
      for(int i=0;i<n;i++){
            cin>>e[i];
      }
      solve(0,0,0,0);
      cout<<"No"<<"\n";
}