#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
int A[MAX_N];
map<int, int> D;
ll ans = -1;
ll zero = 0;
ll pow3[30];

void loop(int a, int b, bool dict, int val, ll bit) {
	if(a == b) {
		if(!dict) {
			if(D.count(-val)) {
				ll v = bit + D[-val];
				if(v != zero) {
					ans = v;
				}
			}
		}
		else {
			D[val] = bit;
		}
	}
	else {
		rep(i, 0, 3) {
			int v = i - 1;
			loop(a + 1, b, dict, val + A[a] * v, bit + i * pow3[a]);
		}
	}
}

void solve() {
	cin >> N;
	rep(i, 0, N) cin >> A[i];
	int a = -1, b = -1;
	map<int, int> D;
	rep(i, 0, N) {
		if(D.count(A[i])) {
			a = D[A[i]]; b = i;
		}
		else {
			D[A[i]] = i;
		}
	}
	if(a != -1) {
		cout << "Yes\n";
		rep(i, 0, N) {
			if(a == i) cout << A[i] << " ";
			else if(b == i) cout << -A[i] << " ";
			else cout << 0 << " ";
		}
		return;
	}
	pow3[0] = 1;
	rep(i, 0, 26) {
		pow3[i + 1] = pow3[i] * 3 % mod;
	}

	int M = min(26, N);

	rep(i, 0, M) {
		zero += pow3[i];
	}

	loop(0, M / 2, true, 0, 0);
	loop(M / 2, M, false, 0, 0);

	if(ans == -1) {
		cout << "No\n";
	}
	else {
		cout << "Yes\n";
		rep(i, 0, M) {
			int v = ans % 3;
			ans /= 3;
			cout << A[i] * (v - 1) << " ";
		}
		rep(i, M, N) {
			cout << A[i] << " ";
		}
		cout << "\n";
	}
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}