#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e9;

signed main(){
	int N;
	cin >> N;
	vector<int>a(N);
	REP(i,N){
		cin >> a[i];
	}
	int n = N;
	CHMIN(N,22ll);
	map<int,int>mp;
	REP(i,1ll << N){
		int sum = 0;
		REP(j,N){
			if((1ll << j) & i){
				sum += a[j];
			}
		}
		if(mp.count(sum)){
			int I = mp[sum];
			int J = i;
			int kaburi = I & J;
			I ^= kaburi;
			J ^= kaburi;
			vector<int>ans;
			REP(j,N){
				if((1ll << j) & I)ans.emplace_back(a[j]);
				else if((1ll << j) & J)ans.emplace_back(-a[j]);
				else ans.emplace_back(0);
			}
			FOR(j,N,n)ans.emplace_back(0);
			out("Yes");
			REP(i,ans.size())cout << ans[i] << " \n"[i+1 == ans.size()];
			return 0;
		}else mp[sum] = i;
	}
	out("No");
}