#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 m=min(n, 35);
	ll s1[1<<18]={}, s2[1<<18]={};
	for(int i=0; i<(1<<(m/2)); i++){
		for(int j=0; j<m/2; j++){
			if(i&(1<<j)) s1[i]+=a[j];
		}
	}
	for(int i=0; i<(1<<(m-m/2)); i++){
		for(int j=0; j<m-m/2; j++){
			if(i&(1<<j)) s2[i]+=a[j+m/2];
		}
	}
	int ans[150010]={};
	P s[3000000];
	fill(s, s+3000000, P(-1, -1));
	for(int i=0; i<(1<<(m/2)); i++){
		for(int j=0; j<(1<<(m-m/2)); j++){
			if(s[s1[i]+s2[j]]==P(-1, -1)){
				s[s1[i]+s2[j]]=P(i, j);
			}else{
				cout<<"Yes"<<endl;
				int i1=s[s1[i]+s2[j]].first, j1=s[s1[i]+s2[j]].second;
				for(int k=0; k<m/2; k++){
					if(i&(1<<k)){
						ans[k]+=a[k];
					}
					if(i1&(1<<k)) ans[k]-=a[k];
				}
				for(int k=0; k<m-m/2; k++){
					if(j&(1<<k)){
						ans[k+m/2]+=a[k+m/2];
					}
					if(j1&(1<<k)) ans[k+m/2]-=a[k+m/2];
				}
				for(int k=0; k<n; k++) cout<<ans[k]<<" ";
				cout<<endl;
				return 0;
			}
		}
	}
	cout<<"No"<<endl;
	return 0;
}