#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n;
	cin>>n;
	vector<int> p(n);
	rep(i,n) cin>>p[i];
	map<ll,set<int>> m;
	m[0]={};
	rep(i,n){
		map<ll,set<int>> n_m;
		for(auto x:m){
			if(m.count(x.first+p[i])){
				auto y=m[x.first+p[i]];
				auto z=x.second;
				z.insert(i);
				yneos(1);
				rep(j,n){
					if(j!=0) cout<<" ";
					if(y.count(j)&&!z.count(j)) cout<<p[j];
					else if(!y.count(j)&&z.count(j)) cout<<p[j]*-1;
					else cout<<0;
				}
				cout<<"\n";
				return 0;
			}
			else{
				ll a=x.first+p[i];
				set<int> b=x.second;
				b.insert(i);
				n_m[a]=b;
			}
		}
		for(auto x:n_m) m[x.first]=x.second;
	}
	yneos(0);
	/*vector<pair<int,int>> data(n);
	rep(i,n) data[i]={p[i],i};
	So(p);
	rep(i,n-1){
		if(data[i].first==data[i+1].first){
			int a=data[i].second;
			int b=data[i+1].second;
			yneos(1);
			rep(j,n){
				if(j!=0) cout<<" ";
				if(j==a) cout<<p[a];
				else if(j==b) cout<<p[b]*-1;
				else cout<<0;
			}
			cout<<"\n";
			return 0;
		}
	}
	map<int,pair<int,int>> m;
	rep(i,n-1){
		int val=data[i+1].first-data[i].first;
		if(m.count(val)){
			int a=m[val].first,b=data[i+1].second;
			int c=m[val].second,d=data[i].second;
			yneos(1);
			rep(j,n){
				if(j!=0) cout<<" ";
				if(j==a||j==b) cout<<p[j];
				else if(j==c||j==d) cout<<p[j]*-1;
				else cout<<0;
			}
			cout<<"\n";
			return 0;
		}
		if(i!=0){
			m[data[i].first-data[i-1].first]={data[i-1].second,data[i].second};
		}
	}*/

}