#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
#include <assert.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define pii pair <int,int>
#define rep(i,n) for(int i = 0 ; i < n ; i++) 
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define vi vector <int> 
#define vec(...) vector<__VA_ARGS__>
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
using namespace std;

const int max_n = 103002;
vi a;

void f(int i,int _a,int b,int c){
	if(i==sz(a)){
		if(_a==b and _a==c){
			cout<<"Yes\n";
			exit(0);
		}
		return;
	}
	f(i+1,_a+a[i],b,c);
	f(i+1,_a,b+a[i],c);
	f(i+1,_a,b,c+a[i]);
}

int main(){
fcin;
	int n;
	cin>>n;
	a.resize(n);
	rep(i,n) cin>>a[i];
	f(0,0,0,0);
	cout<<"No\n";
/*
*/
	return 0;
}