#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
map<ll,vector<int> > mp;
ll n;
vector<ll>a;
vector<int> x,y;
bool flag = 0;

void dfs(vector<int>&s,ll sm,int i,int c,int t){
    if(c + n-i < t)return;
    if(flag)return;
    if(c==t){
        if(mp.find(sm)!=mp.end()){
            flag = 1;
            x = mp[sm];
            y = s;
        }else{
            mp[sm] = s;
        }
        return;
    }
    if(i==n)return;
    dfs(s,sm,i+1,c,t);
    if(flag)return;
    s.push_back(i);
    dfs(s,sm+a[i],i+1,c+1,t);
    s.pop_back();
    if(flag)return;
}
int main(){
    cin >> n;
    a.resize(n);
    rep(i,n)cin >> a[i];
    rep(i,n){
        vector<int> p;
        dfs(p,0,0,0,i+1);
    }
    if(flag){
        cout << "Yes\n";
        set<int> st;
        set<int> st2;
        rep(i,x.size())st.insert(x[i]);
        rep(i,y.size()){
            if(st.count(y[i])==1){
                st.erase(y[i]);
            }else{
                st2.insert(y[i]);
            }
        }
        rep(i,n){
            if(st.count(i)==1){
                cout << a[i] << " ";
            }else if(st2.count(i)==1){
                cout << -a[i] << " ";
            }else{
                cout << 0 << " ";
            }
        }
        cout << "\n";
    }else{
        cout << "No\n";
    }
    return 0;
}