#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vll a(n);get(a);
  vll b(n, 0);
  if(n>=23) n = 22;
  map<ll, ll> mp;

  for(ll i=1;i<(1<<n);i++){
    ll s = 0;
    for(ll j=0;j<22;j++) if((i>>j)&1) s += a[j];
    auto itr = mp.find(s);
    if(itr==mp.end()) mp.emplace(s, i);
    else{
      std::cout << "Yes" << '\n';
      ll X = (*itr).second;
      ll Y = i;
      for(int j=0;j<n;j++){
        if((X>>j)&1) b[j]++;
        if((Y>>j)&1) b[j]--;
      }
      re(j, n) b[j] *= a[j];
      print(b);
      return 0;
    }
  }
  std::cout << "No" << '\n';
  return 0;
}