#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7; //998244353

const int N=30;
ll dp[N+1][412345];

vector<int> solve(vector<int> a){
	fill(dp[0],dp[N+1],0);
	const int O=202345;
	dp[0][O]=1;
	const int n=a.size();
	
	rep(i,n){
		rep(j,412345){
			if(j+a[i]<412345) dp[i+1][j+a[i]]+=dp[i][j];
			dp[i+1][j]+=dp[i][j];
			if(j>=a[i]) dp[i+1][j-a[i]]+=dp[i][j];
		}
	}

	if(dp[n][O]==1) return {};
	vector<int> re;
	int s=O;
	rrep(i,n){
		if(s+a[i]<412345 && dp[i][s+a[i]]){
			s+=a[i];
			re.pb(-a[i]);
		}else if(s>=a[i] && dp[i][s-a[i]]){
			s-=a[i];
			re.pb(a[i]);
		}
	}
	return re;
}


int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout<<fixed<<setprecision(0);
	int n;
	cin>>n;
	vector<int> a(n);
	for(int &x:a) cin>>x;
	auto oa=a;
	vector<int> re;
	rep(_,20){
		random_shuffle(all(a));
		auto b=a;
		if(n>N) b.resize(N);
		re=solve(b);
		if(re.size()) break;
	}
	if(re.size()){
		vector<int> b(n);
		for(int x:re){
			auto ax=abs(x);
			rep(i,n)if(oa[i]==ax && b[i]==0){ b[i]=x; break;}
		}
		cout<<"Yes" NL;
		rep(i,n) cout<<b[i]<<" \n"[i+1==n];
	}else{
		cout<<"No" NL;
	}
  return 0;
}