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

#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long int;

int main() {
  int n;
  cin >> n;
  vector<int> ap, an, az;
  rep(i, n) {
    int ai;
    cin >> ai;
    if (ai > 0)
      ap.push_back(ai);
    else if (ai < 0)
      an.push_back(ai);
    else
      az.push_back(ai);
  }
  sort(ap.begin(), ap.end());
  sort(an.begin(), an.end());
  int ip = (int)ap.size(), in = (int)an.size();
  ll sump, sumn;;
  if (ip > 0) sump = ap[ip-1];
  else        sump = 0;
  if (in > 0) sumn = an[0];
  else        sumn = 0;
  rep(i, in-1)
    sump += an[i+1];
  rep(i, ip-1)
    sumn += ap[i];
  if (sump >= 0 && sumn <= 0)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}