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

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

    int M = min(N, 22);
    vector<int> dp(1<<M, 0);
    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;
    map<int,int> mp;
    for (int i=1; i<(1<<M); ++i) {
        if (mp.count(dp[i])) {
            S = mp[dp[i]];
            T = i;
        }
        mp[dp[i]] = i;
    }

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