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

#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
typedef vector<ll> Array;
typedef vector<Array> Matrix;


template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
	ll to, cap, rev;
	Edge(ll _to, ll _cap, ll _rev) {
	to = _to; cap = _cap; rev = _rev;
	}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
	G[from].push_back(Edge(to, cap, (ll)G[to].size()));
	if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}

void solve(){
    ll n;
    cin>>n;
    Array a(n);
    REP(i,n) cin>>a[i];
    ll m=min(22LL,n);
    ll ml=m/2;
    ll mr=(m+1)/2;

    Array dp(5000000,-1);
    ll bit=1;
    REP(i,ml) bit*=3;
    REP(i,bit){
        ll s=2500000;
        ll x=i;
        REP(j,ml){
            if(x%3==2) s+=a[j];
            else if(x%3==1) s-=a[j];
            x/=3;
        }
        dp[s]=i;
    }
    REP(i,mr-ml) bit*=3;
    REP(i,bit){
        ll s=2500000;
        ll x=i;
        REP(j,mr){
            if(x%3==2) s+=a[j+ml];
            else if(x%3==1) s-=a[j+ml];
            x/=3;
        }
        if(dp[s]==-1 || (dp[s]==0 && i==0)) continue;
        cout<<"Yes"<<en;
        x=dp[s];
        REP(j,ml){
            if(x%3==2) cout<<a[j]<<" ";
            else if(x%3==1) cout<<-a[j]<<" ";
            else cout<<0<<" ";
            x/=3;
        }
        x=i;
        REP(j,mr){
            if(x%3==2) cout<<-a[j+ml]<<" ";
            else if(x%3==1) cout<<a[j+ml]<<" ";
            else cout<<0<<" ";
            x/=3;
        }
        rep(j,mr+ml,n){
            cout<<0<<" ";
        }
        cout<<en;
        return;
    }
    cout<<"No"<<en;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    solve();
    //ll t;cin>>t;REP(i,t) solve();

    return 0;
}