#include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }

ll N;
vector<ll> E;
ll ans = 0;
void dfs(ll index, ll a, ll b, ll c) {
  if (index == N) {
    if (a == b && b == c) {
      ans += 1;
    }
  }
  else {
    dfs(index + 1, a + E.at(index), b, c);
    dfs(index + 1, a, b + E.at(index), c);
    dfs(index + 1, a, b, c + E.at(index));
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N;
  ll sum = 0;
  E = vector<ll>(N);
  for (ll i = 0; i < N; ++i) {
    cin >> E.at(i);
    sum += E.at(i);
  }
  if (sum % 3 != 0) {
    cout << "No" << "\n";
    return 0;
  }
  dfs(0, 0, 0, 0);
  if (ans != 0) {
    cout << "Yes" << "\n";
  }
  else {
    cout << "No" << "\n";
  }
}