#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

llint n, m;
llint a[150005];
vector<P> vec;

void output(llint x, llint y)
{
	llint z = x&y;
	x &= ~z, y &= ~z;
	for(int j = 0; j < n; j++){
		if(j < m && (x & (1<<j))) cout << a[j] << " ";
		else if(j < m && (y & (1<<j))) cout << -a[j] << " ";
		else cout << 0 << " ";
	}
	cout << endl;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i];
	if(n == 1){
		cout << "No" << endl;
		return 0;
	}
	
	
	m = min(n, 23LL);
	llint M = 1 << m;
	for(int i = 1; i < M; i++){
		llint sum = 0;
		for(int j = 0; j < n; j++){
			if(i & (1<<j)) sum += a[j];
		}
		vec.push_back(P(sum, i));
	}
	sort(vec.begin(), vec.end());
	
	for(int i = 1; i < vec.size(); i++){
		if(vec[i-1].first == vec[i].first){
			cout << "Yes" << endl;
			output(vec[i-1].second, vec[i].second);
			return 0;
		}
	}
	cout << "No" << endl;
	
	return 0;
}