#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) REP(sz, vec.size()) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');

const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    V<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    
    int s1 = -1, s2 = -1;
    V<int> states(150000 * 24 + 1, 0);
    for (int state = 1; state < (1 << min(n, 24)); state++) {
        int ssum = 0;
        for (int j = 0; j < min(n, 24); j++) if ((state >> j) & 1) ssum += a[j];
        if (states[ssum] > 0) {
            s1 = states[ssum];
            s2 = state;
            break;
        } else states[ssum] = state;
    }

    if (s1 == -1) cout << "No\n";
    else {
        V<int> ans(n, 0);
        for (int i = 0; i < min(n, 24); i++) {
            if (((s1 >> i) & 1) & ((s2 >> i) & 1)) continue;
            else if ((s1 >> i) & 1) ans[i] = a[i];
            else if ((s2 >> i) & 1) ans[i] = -a[i];
        }
        cout << "Yes\n";
        for (int i = 0; i < n; i++) cout << ans[i] << (i == n - 1 ? '\n' : ' ');
    }
    return 0;
}