#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;

const int DPMX = 4194304;
const int REVMX = 3300001;
ll dp[DPMX];
int rev[REVMX];

int main() {
    fill_n(dp, DPMX, 0);
    fill_n(rev, REVMX, -1);

    int N;
    cin >> N;
    vector<int> A(N);
    for (int i=0; i<N; ++i) cin >> A[i];

    int M = min(N, 22);
    for (int i=1; i<=M; ++i) {
        int l = 1 << (i-1);
        int r = 1 << i;
        for (int j=l; j<r; ++j) {
            dp[j] = dp[j - l] + A[i-1];
        }
    }

    int S = -1, T;
    for (int i=1; i<(1<<M); ++i) {
        if (rev[dp[i]] >= 0) {
            S = rev[dp[i]];
            T = i;
            break;
        }
        rev[dp[i]] = i;
    }

    if (S < 0) {
        cout << "No" << endl;
    } else {
        vector<int> ans(N, 0);
        for (int i=0; i<M; ++i) {
            bool sb = (S >> i) & 1;
            bool tb = (T >> i) & 1;
            if ( ! (sb ^ tb)) continue;
            else if (sb) ans[i] = A[i] * (-1);
            else if (tb) ans[i] = A[i];
        }
        cout << "Yes" << endl;
        for (int i=0; i<N; ++i) {
            cout << ans[i] << (i == N-1 ? "\n" : " ");
        }
        assert(accumulate(ans.begin(), ans.end(), 0) == 0);
    }
    return 0;
}