#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A[202020];
ll S;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>A[i];
		S+=A[i];
	}
	if(S<0) {
		S=-S;
		FOR(i,N) A[i]=-A[i];
	}
	multiset<ll> P,M;
	FOR(i,N) {
		if(A[i]>0) P.insert(A[i]);
		if(A[i]<0) M.insert(-A[i]);
	}
	P.erase(P.find(*P.rbegin()));
	while(P.size()) {
		x=*P.rbegin();
		P.erase(P.find(x));
		auto it=M.lower_bound(x);
		if(it==M.end()) {
			cout<<"No"<<endl;
			return;
		}
		y=*it;
		M.erase(it);
		if(y>x) M.insert(y-x);
	}
	cout<<"Yes"<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}