#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n;
  cin >> n;
  vector<ll> pos, neg;
  rep(i, n) {
    ll a;
    cin >> a;
    if (a > 0)
      pos.push_back(a);
    if (a < 0)
      neg.push_back(-a);
  }
  sort(pos.rbegin(), pos.rend());
  sort(neg.rbegin(), neg.rend());
  while (!pos.empty() && !neg.empty()) {
    ll p = pos.back();
    pos.pop_back();
    ll n = neg.back();
    neg.pop_back();
    if (p > n) {
      pos.push_back(p - n);
    } else if (p < n) {
      neg.push_back(n - p);
    }
  }
  bool ok = pos.size() + neg.size() <= 1;
  cout << (ok ? "Yes" : "No") << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}