#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.rbegin(), an.rend());
  int ip = (int)ap.size(), in = (int)an.size(), iz = (int)az.size();
  ll sump, sumn;;
  if (ip > 0) sump = ap[ip-1];
  else        sump = 0;
  if (in > 0) sumn = an[in-1];
  else        sumn = 0;
  int i = 0;
  int j = 0;
  while (i < in-1 || j < ip-1) {
    bool done = false;
    if (sump >= 0 && sumn <= 0) {
      while (i < in-1 && sump >= 0) {
	sump += an[i];
	i++;
	done = true;
      }
      while (j < ip-1 && sumn <= 0) {
	sumn += ap[j];
	j++;
	done = true;
      }
    }
    if (sump <= 0 && sumn >= 0) {
      while (j < ip-1 && sump <= 0) {
	sump += ap[j];
	j++;
	done = true;
      }
      while (i < in-1 && sumn >= 0) {
	sumn += an[i];
	i++;
	done = true;
      }
    }
    if (!done) break;
  }
  int k = iz;
  while (k > 0 && i < in-1) {
    i++; k--;
  }
  while (k > 0 && j < ip-1) {
    j++; k--;
  }
  bool ans = false;
  if (in == 0 && ip == 0)
    ans = true;
  if (in == 0 && (ip-1) - j == 0)
    ans = true;
  if ((in-1) - i == 0 && ip == 0)
    ans = true;
  if ((in-1) - i == 0 && (ip-1) - j == 0)
    ans = true;
  if (ans)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}