#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

const int k=22;

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n;cin>>n;
    int m=n;
    chmin(n,k);
    vector<int> a(n);
    rep(i,n) cin>>a[i];
    map<ll,ll> bitmemo;
    ll mini=LINF;

    for(int bit=0;bit<(1<<n);bit++){
        ll sum=0;
        rep(i,n)if((bit>>i)&1)sum+=a[i];
        if(bitmemo.count(sum)){
            int p=bitmemo[sum],q=bit;
            rep(i,n){
                if(((p>>i)&1) and (((q>>i)&1))){
                    p^=(1<<i);
                    q^=(1<<i);
                }
            }
            cout<<"Yes"<<endl;
            rep(i,m){
                if(i>=n) cout<<0<<(i+1==m?"\n":" ");
                if((p>>i)&1) cout<<a[i];
                else if((q>>i)&1) cout<<-a[i];
                else cout<<0;
                cout<<(i+1==m?"\n":" ");
            }
            return 0;
        }else{
            bitmemo[sum]=bit;
        }
    }
    cout<<"No"<<endl;
    return 0;
}