#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

int n;
int e[12];

bool dfs(int id, int a, int b, int c) {
	if (id == n) {
		return a == b && b == c;
	}
	if (dfs(id + 1, a + e[id], b, c)) return true;
	if (dfs(id + 1, a, b + e[id], c)) return true;
	if (dfs(id + 1, a, b, c + e[id])) return true;
	return false;
}

signed main() {
	int i;
	
	cin >> n;
	rep(i, n) cin >> e[i];
	
	bool res = dfs(0, 0, 0, 0);
	if (res) cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}