#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

bool next_combination(vector<int>& c, int lim){
  c.push_back(lim);
  int i=c.size()-2;
  for(; i>=0; --i) {
    if(c[i]==c[i+1]) continue;
    c[i] ++;
    for(int j=i+1; j<c.size()-1; j++){
      c[j] = 0;
    }
    break;
  }
  c.pop_back();
  if(i==-1) return false;
  else return true;
}

int main(){

  int n;
  cin >> n;
  vector<int> a(n,0),e(n);
  for(auto& i : e) cin >> i;

  do{
    vector<int> num(3,0);
    for(int i=0; i<n; ++i) {
      num[a[i]] += e[i];
    }
    if(num[0]==num[1] && num[1]==num[2]) {
      cout << "Yes" << endl;
      return 0;
    }
  }while(next_combination(a,2));

  cout << "No" << endl;
  return 0;
}