#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> e(n);
    for(int i = 0; i < n; i++) cin >> e[i];
    vector<int> v(n);
    bool ok = false;
    function<void(int)> dfs = [&](int i){
        if(i == n){
            vector<int> sum(3);
            for(int j = 0; j < n; j++) sum[v[j]] += e[j];
            if(sum[0] == sum[1] && sum[1] == sum[2]) ok = true;
            return;
        }
        for(int j = 0; j <= 2; j++){
            v[i] = j;
            dfs(i+1);
        }
    };
    dfs(0);
    if(ok){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
}