#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;

int n;
VI e(20);
bool ok=0;

void dfs(int i, int a, int b, int c){
    if(i==n){
        if(a==b&&b==c)
            ok=1;
        return;
    }
    dfs(i+1,a+e[i],b,c);
    dfs(i+1,a,b+e[i],c);
    dfs(i+1,a,b,c+e[i]);
}

int main(){
    cin >> n;
    REP(i,n) cin >> e[i];
    dfs(0,0,0,0);
    if(ok)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    return 0;
}