#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  const int N = 22, A = 150000;
  int n; cin >> n;
  vector<int> ans(n, 0);
  chmin(n, N);
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<int> sum(A * N + 1, -1);
  FOR(i, 1, 1 << n) {
    int now = 0;
    REP(j, n) {
      if (i >> j & 1) now += a[j];
    }
    if (sum[now] != -1) {
      int j = sum[now];
      int tmp = i & j;
      i ^= tmp;
      j ^= tmp;
      assert(i > 0);
      assert(j > 0);
      REP(k, n) {
        if (i >> k & 1) ans[k] = a[k];
      }
      REP(k, n) {
        if (j >> k & 1) ans[k] = -a[k];
      }
      cout << "Yes\n";
      REP(k, n) cout << ans[k] << " \n"[k + 1 == n];
      return 0;
    }
    sum[now] = i;
  }
  cout << "No\n";
  return 0;
}