#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int ans[MAX_N];
int a[MAX_N];
int n;
int ok = 0;

map<int,vector<int>> mp;
vector<int> tmp;
int x;

void dfs(int i, int j){
    if(ok)return;
    if(i == n || j >= 22){
        return;
    }
    dfs(i+1,j);
    if(ok)return;
    int y = x + a[i];
    int xx = x;
    if(mp.find(y) != mp.end()){
        ok = 1;
        vector<int> keep = mp[y];
        tmp.push_back(i);

        rep(i,keep.size()){
            // cout << keep[i] << ' ';
            ans[keep[i]]++;
        }
        // cout << endl;

        rep(i,tmp.size()){
            // cout << tmp[i] << ' ';
            ans[tmp[i]]--;
        }
        // cout << endl;

        return;
    }else{
        x = y;
        tmp.push_back(i);
        mp[y] = tmp;
        dfs(i+1,j+1);
    }

    x = xx;
    tmp.erase(tmp.end()-1);

}

int main() {
    cin >> n;
    rep(i,n)cin >> a[i];

    dfs(0,0);

    if(ok == 0){
        cout << "No" << endl;
    }else{
        cout << "Yes" << endl;
        rep(i,n){
            cout << a[i] * ans[i];
            if(i == n - 1) cout << endl;
            else cout << " ";
        }
    }

    return 0;
}