#include <bits/stdc++.h>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
std::mt19937 rnd(std::chrono::steady_clock::now().time_since_epoch().count());
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; }
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;

void solve()
{
  int n; cin >> n;
  std::vector<int> E(n);
  for (int i = 0; i < n; ++i)
  {
    cin >> E[i];
  }
  bool ok = false;
  int s1 = 0, s2 = 0, s3 = 0;
  auto dfs = [&](auto &&self, int cur)->void
  {
    if(cur == n)
    {
      if(s1 == s2 and s2 == s3)
      {
        ok = true;
      }
      return;
    }
    s1 += E[cur];
    self(self, cur + 1);
    s1 -= E[cur];
    s2 += E[cur];
    self(self, cur + 1);
    s2 -= E[cur];
    s3 += E[cur];
    self(self, cur + 1);
    s3 -= E[cur];
  };
  dfs(dfs, 0);
  if(ok)
  {
    cout << "Yes" << "\n";
  }
  else
  {
    cout << "No" << "\n";
  }
}

int main()
{
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  int kkt = 1; 
  // cin >> kkt;
  while(kkt--)
    solve();
  return 0;
}