#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>

using namespace std;

const long long MOD = (long long)(1e9) + 7;

int n;
vector<int> e;
bool ans = false;

void dfs (long long a , long long b , long long c , int depth) {

  if (depth >= n) {
    if (a == b && b == c && c == a) ans = true;
    return;
  }

  dfs(a + e[depth] , b , c , depth + 1);
  dfs(a , b + e[depth] , c , depth + 1);
  dfs(a , b , c + e[depth] , depth + 1);

  return;
}
int main() {

  //cout << fixed << setprecision(15);

  cin >> n;
  e = vector<int>(n);
  for (int i = 0; i < n; i++) {
    cin >> e[i];
  }
  dfs(0,0,0,0);
  cout << (ans ? "Yes" : "No") << endl;
  return 0;
}