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

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n);
  for (auto&& e : a) {
    cin >> e;
  }
  vector<int> ord(n);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), [&](int i, int j) {
    return a[i] < a[j];
  });
  for (int t = 0; t < n - 1; ++t) {
    if (a[ord[t]] == a[ord[t + 1]]) {
      cout << "Yes\n";
      for (int i = 0; i < n; ++i) {
        cout << (i == ord[t] ? a[i] : i == ord[t + 1] ? -a[i] : 0) << " \n"[i == n - 1];
      }
      exit(0);
    }
  }
  int m = min(n, 22);
  vector<int> v(150000 * m);
  for (int bt = 1; bt < 1 << m; ++bt) {
    int sum = 0;
    for (int i = 0; i < m; ++i) {
      if (bt >> i & 1) {
        sum += a[i];
      }
    }
    if (v[sum]) {
      cout << "Yes\n";
      vector<int> res(n);
      int x = bt & ~v[sum], y = v[sum] & ~bt;
      assert((x & y) == 0);
      int s = 0, t = 0;
      for (int i = 0; i < m; ++i) {
        if (x >> i & 1) {
          res[i] = a[i];
          s += a[i];
        } else if (y >> i & 1) {
          res[i] = -a[i];
          t += a[i];
        }
      }
      assert(s == t);
      for (int i = 0; i < n; ++i) {
        cout << res[i] << " \n"[i == n - 1];
      }
      exit(0);
    }
    v[sum] = bt;
  }
  cout << "No\n";
}