#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<endl
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1e18+7;
const lint inf=1e9+7;
const int MOD=1000000007;
signed main(){
  int n;cin>>n;
  vector<lint> e(n);
  rep(i,n)cin>>e[i];
  auto judge=[&](vector<int> const& status){
    vector<lint> a(3,0);
    rep(i,n)a[status[i]-1]+=e[i];
    sort(a.begin(),a.end());
    if(a[0]==a[2]){
      cout<<"Yes"<<"\n";
      exit(0);
    }
  };
  auto rec=[&](auto& rec,vector<int> status,int cur)->void{
    if(cur==n){
      judge(status);
      return;
    }
    rep1(i,3){
      status[cur]=i;
      rec(rec,status,cur+1);
    }
  };
  rec(rec,vector<int>(n,0),0);
  cout<<"No"<<"\n";
  return 0;
}