#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
  int n;
  cin >> n;
  vector<ll> a(n);
  for(int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int ans = 0;
  for(int bit = 1; bit < (int)pow(3, n); bit++) {
    vector<ll> sum(3, 0);
    int tmp = bit;
    for(int i = 0; i < n; i++) {
      sum[tmp % 3] += a[i];
      tmp /= 3;
    }
    if(sum[0] == sum[1] && sum[1] == sum[2]) {
      ans++;
    }
  }
  if(ans > 0) {
    cout << "Yes\n";
  } else {
    cout << "No\n";
  }
  return 0;
}