#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}




int main(){
	int n; cin >> n;
	vector<int> e(n);
	rep(i,0,n) cin >> e[i];
	int esm = sum(e);

	rep(i,0,1<<n){
		rep(j,0,1<<n){
			if ((i&j)!=0) continue;
			int tmp1 = 0, tmp2 = 0;
			rep(x,0,n){
				if (i >> x & 1){
					tmp1 += e[x];
				}
				if (j >> x & 1){
					tmp2 += e[x];
				}
			}
			if (tmp1 == tmp2 && tmp2 == esm - tmp1 - tmp2){
				cout << "Yes\n";
				return 0;
			}
		}
	}
	cout << "No\n";
}