#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
//#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

map<int, vii> mp;
int n;
vi a;

void output(vii idx) {
    //DEBUG_MAT(idx);
    vi idx1 = idx[0];
    vi idx2 = idx[1];
    set<int> st1, st2;
    for (int i: idx1) {
        st1.insert(i);
    }
    for (int i: idx2) {
        if (st1.count(i)) st1.erase(i);
        else st2.insert(i);
    }
    
    cout << "Yes" << endl;
    rep (i, n) {
        if (st1.count(i)) cout << a[i] << " ";
        else if (st2.count(i)) cout << -a[i] << " ";
        else cout << 0 << " ";
    }
    cout << endl;
    exit(0);
}

void dfs(int idx, vi& use, int sum) {
    if (idx == n) return;
    
    if (use.size() == 10) return;

    use.push_back(idx);
    sum += a[idx];
    if (use.size() > 0) {
        mp[sum].push_back(use);
        if (mp[sum].size() == 2) {
            output(mp[sum]);
        }
    }

    dfs(idx + 1, use, sum);
    use.pop_back();
    sum -= a[idx];

    dfs(idx + 1, use, sum);
    return;
}

signed main() {
    fio();
    cin >> n;
    a.resize(n);

    rep (i, n) cin >> a[i];
    set<int> st;
    rep (i, n) {
        if (st.count(a[i])) {
            for (int j = 0; j < i; j++) {
                if (a[i] == a[j]) {
                    cout << -a[j] << " ";
                }
                else {
                    cout << 0 << " ";
                }
            }
            cout << a[i] << " ";
            for (int j = i + 1; j < n; j++) {
                cout << 0 << " ";
            }
            cout << endl;
            return 0;
        }  
        st.insert(a[i]);
    }

        
    vi use;
    int sum = 0;
    dfs(0, use, sum);
    assert(n <= 20);

    const int M = 150000 * 40 + 1;
    vector<bitset<M>> dp(n + 1);
    dp[0][M / 2] = true;
    rep (i, n) {
        rep (j, M) {
            if (not dp[i][j]) continue;
            if (j != M / 2) {
                dp[i + 1][j] = true;
            }
            dp[i + 1][j + a[i]] = true;
            dp[i + 1][j - a[i]] = true;
        }
    }

    rep1 (y, n) {
        if (dp[y][M / 2]) {
            cout << "Yes" << endl;
            int i = y - 1;
            int j = M / 2;
            set<int> st1, st2;
            while (i >= 0) {
                if (dp[i][j + a[i]]) {
                    st1.insert(i);
                    j += a[i];
                }
                else if (dp[i][j - a[i]]) {
                    st2.insert(i);
                    j -= a[i];
                }
                i--;
            }

            rep (i, n) {
                if (st1.count(i)) cout << a[i] << " ";
                else if (st2.count(i)) cout << -a[i] << " ";
                else cout << 0 << " ";
            }
            cout << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}