#include<iostream>
#include<vector>
using namespace std;
int N;
long A[150000];
long B[150000];
vector<int>ids[150001];
vector<int>c[1<<20];
vector<int>now;
bool dfs(int id,int sum)
{
	if(id==N)return false;
	if(dfs(id+1,sum))return true;
	sum+=A[id];
	now.push_back(id);
	if(sum<1<<20)
	{
		if(c[sum].empty())
		{
			c[sum]=now;
			if(dfs(id+1,sum))return true;
		}
		else
		{
			for(int i:c[sum])B[i]=1;
			for(int j:now)
			{
				if(B[j]==1)B[j]=0;
				else B[j]=-1;
			}
			for(int k=0;k<N;k++)B[k]*=A[k];
			return true;
		}
	}
	now.pop_back();
	return false;
}
main()
{
	cin>>N;
	for(int i=0;i<N;i++)
	{
		cin>>A[i];
		ids[A[i]].push_back(i);
	}
	if(N<=18)
	{
		for(int I=1;I<1<<N;I++)for(int J=I&I-1;J;J=J-1&I)
		{
			long sum=0;
			for(int k=0;k<N;k++)
			{
				if(I>>k&1)
				{
					if(J>>k&1)B[k]=A[k];
					else B[k]=-A[k];
				}
				else B[k]=0;
				sum+=B[k];
			}
			if(sum==0)
			{
				cout<<"Yes"<<endl;
				for(int k=0;k<N;k++)cout<<B[k]<<(k+1==N?"\n":" ");
				return 0;
			}
		}
		cout<<"No"<<endl;
		return 0;
	}
	for(int i=1;i<=150000;i++)
	{
		if(ids[i].size()>=2)
		{
			cout<<"Yes"<<endl;
			for(int k=0;k<N;k++)
			{
				if(ids[i][0]==k)cout<<i;
				else if(ids[i][1]==k)cout<<-i;
				else cout<<0;
				cout<<(k+1==N?"\n":" ");
			}
			return 0;
		}
	}
	if(dfs(0,0))
	{
		cout<<"Yes"<<endl;
		for(int k=0;k<N;k++)cout<<B[k]<<(k+1==N?"\n":" ");
	}
	else cout<<"No"<<endl;
}