#include using namespace std; // #include // using namespace atcoder; #define rep(i,n) for (int i = 0; i < (n); ++i) #define rep1(i,n) for (int i = 1; i <= (n); ++i) #define quit(a) {cout << a << endl; return 0;} using ll = long long; using P = pair; // using mint = modint998244353; // using mint = modint1000000007; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } const int INF = 1001001001; const ll LINF = 1002003004005006007ll; int main() { int n; cin >> n; vector a(n); rep(i,n) cin >> a[i]; rep(b,(int)pow(3,n)){ vector tot(3); int bi = b; rep(i,n) tot[bi%3] += a[i], bi /= 3; if ((tot[0] == tot[1]) && (tot[1] == tot[2])) quit("Yes"); } cout << "No" << endl; return 0; }