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