#include <bits/stdc++.h>
//#include <atcoder/modint>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
typedef long long ll;
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
ll keta_(ll a){ll r=0;while(a){a/=10;r++;}return r;}



int main(){

	int N;
	cin >> N;
	vector<ll> E(N);
	FOR(i,0,N) cin >> E[i];

	ll k = 1;
	FOR(i,0,N) k *= 3;
	ll ans = 0;
	FOR(s,0,k){
		ll S = s;
		vector<ll> sum(3,0);
		FOR(i,0,N){
			sum[S%3] += E[i];
			S /= 3;
		}
		if(sum[0] == sum[1] && sum[0] == sum[2]){
			cout << "Yes" << endl;
			return 0;
		}
	}
	cout << "No" << endl;
}