#pragma GCC optimize("O3")
#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
long gcd(long a,long b){return b?gcd(b,a%b):a;}
vector<pair<long,long> >M[1<<7];
int N;
long A[7];
main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		M[1<<i].push_back(make_pair(A[i],1));
	}
	for(int i=1;i+1<1<<N;i++)
	{
		for(int x=i&i-1;x>(i&~x);x=x-1&i)
		{
			int y=i&~x;
			for(const pair<long,long>&X:M[x])
			{
				for(const pair<long,long>&Y:M[y])
				{
					M[i].push_back(make_pair(X.first*Y.second+Y.first*X.second,X.second*Y.second));
					M[i].push_back(make_pair(X.first*Y.second-Y.first*X.second,X.second*Y.second));
					M[i].push_back(make_pair(-X.first*Y.second+Y.first*X.second,X.second*Y.second));
					M[i].push_back(make_pair(X.first*Y.first,X.second*Y.second));
					M[i].push_back(make_pair(X.first*Y.second,X.second*Y.first));
					M[i].push_back(make_pair(Y.first*X.second,Y.second*X.first));
				}
			}
		}
		for(pair<long,long>&p:M[i])
		{
			long g=gcd(p.first,p.second);
			p.first/=g;
			p.second/=g;
		}
		sort(M[i].begin(),M[i].end());
		M[i].erase(unique(M[i].begin(),M[i].end()),M[i].end());
	}
	for(int i=1;i+1<1<<N;i++)
	{
		int t=(1<<N)-1&~i;
		for(int j=t&t-1;j;j=j-1&t)
		{
			int ii=0,jj=0;
			while(ii<M[i].size()&&jj<M[j].size())
			{
				if(M[i][ii]==M[j][jj])
				{
					cout<<"YES"<<endl;
					return 0;
				}
				else if(M[i][ii]<M[j][jj])ii++;
				else jj++;
			}
		}
	}
	cout<<"NO"<<endl;
}