#pragma GCC optimize "Ofast"
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <ranges>
#include <iomanip>
using namespace std;
using ll = long long;

auto range(int n) { return views::iota(0, n); }

template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

map<int, int> brute(vector<int> vs) {
  int n = vs.size();
  int loop = pow(3, n);
  map<int, int> st;
  for (int b : range(loop)) {
    int tot = 0;
    for (int j = 0, y = b; y; y /= 3, j++) {
      if (y % 3 == 1) tot += vs[j];
      if (y % 3 == 2) tot -= vs[j];
    }
    st[tot] = b;
  }
  return st;
}

void recover(vector<int> vs, int b, vector<int>& sign) {
  int n = vs.size();
  sign.resize(n);
  for (int j = 0, y = b; j < n; y /= 3, j++) {
    if (y % 3 == 0) sign[j] = 0;
    if (y % 3 == 1) sign[j] = vs[j];
    if (y % 3 == 2) sign[j] = -vs[j];
  }
}

void solve() {
  int n; cin >> n;
  vector<int> vs(n);
  for (int i : range(n)) cin >> vs[i];

  int dmax = min(n, 20);
  int half = dmax / 2;

  vector<int> v1(vs.begin(), vs.begin() + half);
  vector<int> v2(vs.begin() + half, vs.begin() + dmax);

  auto st1 = brute(v1);
  auto st2 = brute(v2);

  for (auto p : st1) if (st2.count(-p.first)) {
    auto q = *st2.find(-p.first);
    if (p.second == 0 && q.second == 0) continue;

    cout << "Yes" << endl;
    vector<int> sign;
    recover(v1, p.second, sign);
    for (int s : sign) cout << s << " ";

    recover(v2, q.second, sign);
    for (int s : sign) cout << s << " ";

    for (int j = dmax; j < n; ++j) cout << "0 ";
    cout << endl;
    return;
  }
  cout << "No" << endl;
}

int main() {
  cout << fixed << setprecision(12);
  solve();
}