#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

int n;
ll e[15];
bool ans = false;

void solve(int i, ll a, ll b, ll c){
	if(i<n){
		solve(i+1,a+e[i],b,c);
		solve(i+1,a,b+e[i],c);
		solve(i+1,a,b,c+e[i]);
	}else{
		if(a==b && b==c && c==a){
			ans = true;
		}
	}
}

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