#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

void solve() {
    int N;
    cin >> N;
    vi A(N);
    rep(i, N) {
        cin >> A[i];
    }
    int M = min(N, 22);

    vector<int> B(150000 * M + 1);
    for (int S = 1; S < (1 << M); ++S) {
        int x = 0;
        rep(i, M)if (S >> i & 1) {
            x += A[i];
        }
        if (B[x]) {
            cout << "Yes" << endl;
            rep(i, N) {
                if (i < M) {
                    if (!((S ^ B[x]) >> i & 1)) {
                        cout << 0;
                    } else if (S >> i & 1) {
                        cout << 1 * A[i];
                    } else {
                        cout << -1 * A[i];
                    }
                } else {
                    cout << 0;
                }
                cout << (i != N - 1 ? ' ' : '\n');
            }
            return;
        }
        B[x] = S;
    }

    cout << "No" << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    solve();
    return 0;
}