#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 2e5 + 11;
const int M = (1 << 22);
int a[N], b[M];

int ans[N];

void solve(int n, int k1, int k2) {
	int m = min(n, 22);
	for(int i = 0; i < m; i ++) {
		int f1 = (k1 >> i) & 1;
		int f2 = (k2 >> i) & 1;
		if(f1 && !f2) ans[i] = a[i];
		if(!f1 && f2) ans[i] = -a[i];
	}
	cout << "Yes\n";
	for(int i = 0; i < n; i ++)
		cout << ans[i] << ' ';
	cout << '\n';
}

int main() {
	ios :: sync_with_stdio(false);
	
	int n; cin >> n;
	for(int i = 0; i < n; i ++)
		cin >> a[i];
	
	if(n > 22) {
		for(int i = 22; i < n; i ++)
			a[i] = 0;
	}
	
	int m = min(n, 22);
	for(int k = 1; k < (1 << m); k ++) {
		int s = 0;
		for(int i = 0; i < m; i ++)
			if((k >> i) & 1)
				s += a[i];
		
		if(b[s]) {
			solve(n, k, b[s]);
			return 0;
		} else {
			b[s] = k;
		}
	}
	
	cout << "No\n";
}