#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int n;
vector<int> a;

void solve1() {
    vector<int> memo(5000000, -1);
    for(int i = 1; i < (1 << n); i++) {
        bitset<23> b(i);
        int sum = 0;
        for(int j = 0; j < 23; j++) if(b[j]) sum += a[j];
        if(memo[sum] != -1) {
            cout << "Yes" << endl;
            bitset<23> b2(memo[sum]);
            for(int j = 0; j < n; j++) {
                if(j) cout << " ";
                if(b[j] && !b2[j]) cout << a[j];
                else if(!b[j] && b2[j]) cout << -a[j];
                else cout << 0; 
            }
            cout << endl;
            return;
        } else memo[sum] = i;
    }
    cout << "No" << endl;
    return;
}

int get_rand() {
    random_device rd;
    mt19937 mt(rd());
    return abs((int)mt());
}

void solve2() {
    vector<vector<int>> memo(2000000);
    set<vector<int>> used;
    cout << "Yes" << endl;
    while(1) {
        set<int> st; st.insert(-1);
        vector<int> idxv;
        int sum = 0;
        for(int i = 0; i < 12; i++) {
            int idx = -1;
            while(st.count(idx)) idx = get_rand() % n;
            st.insert(idx);
            idxv.push_back(idx); sum += a[idx];
        }
        sort(idxv.begin(), idxv.end());
        if(used.count(idxv)) continue;
        used.insert(idxv);
        if(!memo[sum].empty()) {
            vector<int> idxv2 = memo[sum];
            vector<int> ansign(n, 0);
            for(int i = 0; i < 12; i++) {
                ansign[idxv[i]]++;
                ansign[idxv2[i]]--;
            }
            for(int i = 0; i < n; i++) {
                if(i) cout << " ";
                cout << a[i] * ansign[i];
            }
            cout << endl;
            return;
        } else memo[sum] = idxv;
    }
    return;
}

int main() {
    cin >> n;
    a.resize(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    if(n < 24) solve1();
    else solve2();
    return 0;
}