#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	cin>>n;
	int a[150010], c[150010];
	int p=-1, q=-1;
	fill(c, c+150001, -1);
	for(int i=0; i<n; i++){
		cin>>a[i];
		if(c[a[i]]==-1){
			c[a[i]]=i;
		}else{
			p=c[a[i]], q=i;
			break;
		}
	}
	if(n==1){
		cout<<"No"<<endl;
		return 0;
	}
	if(p!=-1){
		cout<<"Yes"<<endl;
		for(int i=0; i<n; i++){
			if(i==p) cout<<a[i]<<" ";
			else if(i==q) cout<<-a[i]<<" ";
			else cout<<0<<" ";
		}
		cout<<endl;
		return 0;
	}
	int p2, q2;
	P s[300030];
	fill(s, s+300001, P(-1, -1));
	for(int i=0; i<n; i++){
		for(int j=0; j<i; j++){
			if(s[a[i]+a[j]]==P(-1, -1)){
				s[a[i]+a[j]]=P(j, i);
			}else{
				p=j, q=i, p2=s[a[i]+a[j]].first, q2=s[a[i]+a[j]].second;
				break;
			}
		}
		if(p!=-1) break;
	}
	if(p!=-1){
		cout<<"Yes"<<endl;
		for(int i=0; i<n; i++){
			if(i==p || i==q) cout<<a[i]<<" ";
			else if(i==p2 || i==q2) cout<<-a[i]<<" ";
			else cout<<0<<" ";
		}
		cout<<endl;
		return 0;
	}
	for(int j=0; j<n; j++){
		if(s[a[j]]!=P(-1, -1)){
			p2=s[a[j]].first, q2=s[a[j]].second;
			cout<<"Yes"<<endl;
			for(int i=0; i<n; i++){
				if(i==j) cout<<a[i]<<" ";
				else if(i==p2 || i==q2) cout<<-a[i]<<" ";
				else cout<<0<<" ";
			}
			cout<<endl;
			return 0;
		}
	}
	map<int, int> dp[1000], prev[1000];
	dp[0][0]=1;
	sort(a, a+n);
	int ans[150010]={};
	for(int i=0; i<n; i++){
		dp[i+1]=dp[i];
		for(auto pr:dp[i]){
			int x=pr.first;
			dp[i+1][x+a[i]]++;
			prev[i+1][x+a[i]]=x;
			dp[i+1][x-a[i]]++;
			prev[i+1][x-a[i]]=x;
			prev[i+1][x]=x;
		}
		if(dp[i+1][0]>1){
			cout<<"Yes"<<endl;
			int k=0;
			for(int j=i+1; j>=1; j--){
				ans[j-1]=k-prev[j][k];
				k-=ans[j-1];
			}
			for(int i=0; i<n; i++) cout<<ans[i]<<" ";
			cout<<endl;
			return 0;
		}
	}
	cout<<"No"<<endl;
	return 0;
}