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

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

int main() {
	int N;
	cin >> N;
	multiset<int> p, m;
	ll s = 0;
	rep(i, N) {
		int a;
		cin >> a;
		if(a < 0) m.insert(a);
		if(a > 0) p.insert(a);
		s += a;
	}
	string ans = "No";
	if(m.size() + p.size() <= 1) ans = "Yes";
	else if(s < 0) {
		while(1) {
			if(p.size() + m.size() == 1) {
				ans = "Yes";
				break;
			}
			if(p.size() == 0) break;
			int pn = *prev(p.end());
			p.erase(prev(p.end()));
			int mn = *prev(m.end());
			m.erase(prev(m.end()));
			int sum = pn + mn;
			if(sum <= 0) m.insert(sum);
			else p.insert(sum);
		}
	}
	else {
		while(1) {
			if(p.size() + m.size() == 1) {
				ans = "Yes";
				break;
			}
			if(m.size() == 0) break;
			int pn = *p.begin();
			p.erase(p.begin());
			int mn = *m.begin();
			m.erase(m.begin());
			int sum = pn + mn;
			if(sum <= 0) m.insert(sum);
			else p.insert(sum);
		}
	}

	cout << ans << endl;
}