#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;
  vector<int> E(N);

  for (int i = 0; i < N; ++i) {
    cin >> E[i];
  }

  int L = pow(3, N);
  for (int mask = 0; mask < L; ++mask) {
    int powers[3] = {0, 0, 0};
    int a = mask;

    for (int i = 0; i < N; ++i) {
      int d = a % 3;

      powers[d] += E[i];
      a /= 3;
    }

    if (powers[0] == powers[1] && powers[1] == powers[2]) {
      cout << "Yes" << endl;
      return 0;
    }
  }

  cout << "No" << endl;

  return 0;
}