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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	vector<ll> a(n);
	rep(i,0,n){
		cin >> a[i];
	}
	priority_queue<ll,vector<ll>,greater<ll>> plus;
	priority_queue<ll,vector<ll>,greater<ll>> minus;
	rep(i,0,n){
		if (a[i] > 0){
			plus.push(a[i]);
		}else{
			minus.push(-a[i]);
		}
	}
	while(!plus.empty() && !minus.empty()){
		ll x = plus.top();
		ll y = minus.top();
		plus.pop();
		minus.pop();
		if (x == y){
			continue;
		}else if(x > y){
			plus.push(x - y);
		}else{
			minus.push(y - x);
		}
	}
	if ((int)plus.size() + (int)minus.size() <= 1){
		cout << "Yes\n";
	}else{
		cout << "No\n";
	}
}