#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

int main(){

	priority_queue<long long,vector<long long>,greater<long long>> X,Y;
	int n;
	cin>>n;
	rep(i,n){
		long long t;
		cin>>t;
		if(t==0)continue;
		if(t<0)X.push(-t);
		else Y.push(t);
	}
	
	while(X.size()+Y.size()>=2){
		if(X.size()==0 || Y.size()==0){
			cout<<"No"<<endl;
			return 0;
		}
		long long nxt = -X.top() + Y.top();
		X.pop(),Y.pop();
		if(nxt<0)X.push(-nxt);
		else if(nxt>0)Y.push(nxt);
	}
	cout<<"Yes"<<endl;
	return 0;
}