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

int main() {
	int n;
	cin >> n;
	vector<int> pos;
	vector<int> neg;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		if (a > 0)
			pos.push_back(a);
		if (a < 0)
			neg.push_back(a);
	}
	sort(neg.begin(), neg.end());
	sort(pos.rbegin(), pos.rend());
	while (pos.size() && neg.size()) {
		int s = pos.back() + neg.back();
		if (s > 0) {
			pos[pos.size() - 1] = s;
			neg.pop_back();
		} else if (s < 0) {
			neg[neg.size() - 1] = s;
			pos.pop_back();
		} else {
			pos.pop_back();
			neg.pop_back();
		}
	}
	cout << (max(pos.size(), neg.size()) > 1 ? "No" : "Yes") << endl;
	return 0;
}