#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N;
  cin >> N;
  vector<ll> E(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> E.at(i);
  }

  ll pw = 1;
  for (ll i = 0; i < N; i++)
  {
    pw *= 3;
  }

  for (ll b = 0; b < pw; b++)
  {
    vector<ll> P(3, 0);
    for (ll i = 0, bb = b; i < N; i++, bb /= 3)
    {
      P.at(bb % 3) += E.at(i);
    }

    if (P.at(0) == P.at(1) && P.at(1) == P.at(2))
      FINALANS("Yes");
  }
  FINALANS("No");
}