#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

#ifdef LOCAL
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else 
#define dump(x) true
#endif

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

const int B = 150000 * 11 + 5;
const int SZ = B * 2;

bool dp[24][2][SZ];
pii pre[24][2][SZ];

int main() {
	dp[0][0][B] = 1;
	int N; cin >> N;
	V<int> A(N), ans(N);
	rep(i, N) {
		cin >> A[i];
	}
	int now = 0;
	rep(i, min(N, 23)) {
		rep(k, 2) {
			rep(j, SZ) {
				if (dp[i][k][j]) {
					if (j + A[i] < SZ) {
						dp[i+1][1][j + A[i]] = 1;
						pre[i+1][1][j + A[i]] = mp(k, j);
					}
					dp[i+1][k][j] = 1;
					pre[i+1][k][j] = mp(k, j);
					if (j - A[i] >= 0) {
						dp[i+1][1][j - A[i]] = 1;
						pre[i+1][1][j - A[i]] = mp(k, j);
					}					
				}
			}
		}
		now++;
	}

	if (!dp[now][1][B]) {
		puts("No");
		return 0;
	}

	int p = now, k = 1, v = B;
	rep(t, now) {
		pii nx = pre[p][k][v];
		--p;
		if (nx.se < v) {
			ans[p] = 1;
		} else if (nx.se > v) {
			ans[p] = -1;
		} else {
			ans[p] = 0;
		}
		tie(k, v) = nx;
	}

	puts("Yes");
	rep(i, N) {
		printf("%d%c", ans[i] * A[i], i == N-1 ? '\n' : ' ');
	}

	return 0;
}