#include "bits/stdc++.h"
#define int long long

using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
int N;
int E[13];
bool ans = false;
void dfs(int i, vector<int> &A, vector<int>&B, vector<int>&C) {
	if (i == N) {
		int PA = 0, PB = 0, PC = 0;
		for (auto x : A)PA += x;
		for (auto x : B)PB += x;
		for (auto x : C)PC += x;
		if (PA == PB && PB == PC)ans = true;
		return;
	}
	A.push_back(E[i]);
	dfs(i + 1, A, B, C);
	A.pop_back();
	B.push_back(E[i]);
	dfs(i + 1, A, B, C);
	B.pop_back(); C.push_back(E[i]);
	dfs(i + 1, A, B, C);
	C.pop_back();
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> N;
	for (int i = 0; i < N; i++)cin >> E[i];
	vector<int>A, B, C;
	dfs(0, A, B, C);
	if (ans)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;


}