#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=200005,INF=1<<30;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;cin>>N;
    vector<int> A(N),cnt(150003),B;
    for(int i=0;i<N;i++){
        cin>>A[i];
        cnt[A[i]]++;
    }
    B=A;
    
    for(int i=0;i<150003;i++){
        if(cnt[i]>=2){
            cout<<"Yes"<<endl;
            int a=0;
            for(int j=0;j<N;j++){
                if(A[j]==i){
                    if(a==0) a++;
                    else if(a==1){
                        A[j]*=-1;
                        a++;
                    }else A[j]=0;
                }else A[j]=0;
            }
            for(int j=0;j<N;j++){
                if(j) cout<<" ";
                cout<<A[j];
            }
            cout<<endl;
            
            return 0;
        }
    }
    sort(all(A));
    
    if(N>=1000){
        vector<pair<int,int>> when(150003,{-1,-1});
        for(int i=0;i+1<N;i++){
            int a=when[A[i+1]-A[i]].first;
            if(a!=-1&&a!=i-1){
                int p1=A[when[A[i+1]-A[i]].first],p2=A[i+1];
                int m1=A[when[A[i+1]-A[i]].second],m2=A[i];
                
                for(int j=0;j<N;j++){
                    if(B[j]==p1||B[j]==p2) continue;
                    if(B[j]==m1||B[j]==m2) B[j]*=-1;
                    else B[j]=0;
                }
                
                cout<<"Yes"<<endl;
                
                for(int j=0;j<N;j++){
                    if(j) cout<<" ";
                    cout<<B[j];
                }
                cout<<endl;
                
                return 0;
            }
            
            if(a==-1){
                when[A[i+1]-A[i]]={i,i+1};
            }
        }
    }
    
    vector<pair<int,int>> when(150003,{-1,-1});
    for(int l=1;l<N;l++){
        for(int i=0;i+l<N;i++){
            int j=i+l;
            int a=when[A[j]-A[i]].first,b=when[A[j]-A[i]].second;
            if(i==a||i==b||j==a||j==b) continue;
            
            if(a!=-1){
                for(int k=0;k<N;k++){
                    if(B[k]==A[i]||B[k]==A[b]) continue;
                    if(B[k]==A[j]||B[k]==A[a]) B[k]*=-1;
                    else B[k]=0;
                }
                
                cout<<"Yes"<<endl;
                
                for(int k=0;k<N;k++){
                    if(k) cout<<" ";
                    cout<<B[k];
                }
                cout<<endl;
                
                return 0;
            }
            if(a==-1){
                when[A[j]-A[i]]={i,j};
            }
        }
    }
    
    for(int bit=0;bit<(1<<N);bit++){
        for(int U=bit;;U=(U-1)&bit){
            int V=bit-U;
            
            ll suma=0,sumb=0;
            for(int i=0;i<N;i++){
                if(U&(1<<i)) suma+=A[i];
                if(V&(1<<i)) sumb+=A[i];
            }
            
            if(suma&&suma==sumb){
                vector<int> use(150003);
                for(int i=0;i<N;i++){
                    if(U&(1<<i)) use[A[i]]=1;
                    if(V&(1<<i)) use[A[i]]=2;
                }
                
                for(int i=0;i<N;i++){
                    if(use[B[i]]==0) B[i]=0;
                    else if(use[B[i]]==2) B[i]*=-1;
                }
                
                cout<<"Yes"<<endl;
                
                for(int i=0;i<N;i++){
                    if(i) cout<<" ";
                    cout<<B[i];
                }
                cout<<endl;
                
                return 0;
            }
            
            if(U==0) break;
        }
    }
    
    cout<<"No"<<endl;
}