#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;

int main(){
  int n;
  cin >> n;
  vector<int> e(n);
  rep(i,n) cin >> e[i];
  vector<int> p(3);
  auto dfs = [&](auto&& self, int id) -> bool {
    bool can = false;
    if(id == n) {
      if(p[0] == p[1] and p[1] == p[2]) return true;
      return false;
    }
    rep(i,3) {
      p[i] += e[id];
      if(self(self,id+1)) can = true;
      p[i] -= e[id];
    }
    return can;
  };
  cout << (dfs(dfs,0) ? "Yes" : "No") << endl;
  return 0;
}