#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;

vector<int> solve(int n, const vector<int> & a) {
    constexpr int K = 22;
    int size = *max_element(ALL(a)) * K + 1;
    assert (size < (1 << K));
    int k = min(n, K);
    vector<int> found(size);
    REP (s, 1 << k) {
        int acc = 0;
        REP (i, k) if (s & (1 << i)) {
            acc += a[i];
        }
        if (found[acc]) {
            int t = found[acc];
            vector<int> x(n);
            REP (i, k) {
                if (s & (1 << i)) {
                    x[i] += 1;
                }
                if (t & (1 << i)) {
                    x[i] -= 1;
                }
            }
            return x;
        }
        found[acc] = s;
    }
    return vector<int>();
}

// generated by online-judge-template-generator (https://github.com/kmyk/online-judge-template-generator)
const string YES = "Yes";
const string NO = "No";
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    constexpr char endl = '\n';
    int N;
    cin >> N;
    vector<int> A(N);
    REP (i, N) {
        cin >> A[i];
    }
    auto x = solve(N, A);
    if (x.empty()) {
        cout << NO << endl;
    } else {
        cout << YES << endl;
        REP (i, N) {
            cout << (A[i] * x[i]) << (i + 1 < N ? ' ' : '\n');
        }
    }
    return 0;
}