#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
//const ll mod = 1000000007;
map<ll, vector<ll>> mp;

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N;
    cin >> N;
    vector<int> A(N), ans(N);
    for(int i = 0; i < N; i++) cin >> A[i];
    for(int i = 0; i < (1 << N); i++) {
        ll sum = 0;
        for(int j = 0; j <= min(N, 30LL); j++) {
            if(i & (1 << j)) sum += A[j];
        }
        if(mp.count(sum)) {
            for(int j = 0; j <= min(N, 30LL); j++) {
                if(i & (1 << j)) ans[j] += A[j];
            }
            for(auto tmp : mp[sum]) {
                ans[tmp] -= A[tmp];
            }
            cout << "Yes" << endl;
            for(int i = 0; i < N; i++) {
                if(i != 0) cout << " ";
                cout << ans[i];
            }
            cout << endl;
            return 0;
        } else {
            for(int j = 0; j <= min(N, 30LL); j++) {
                if(i & (1 << j)) mp[sum].push_back(j);
            }
        }
    }
    cout << "No" << endl;
    return 0;
}