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

using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

const int B = 150000 * 11 + 5;
const int SZ = B * 2;

bool dp[24][SZ];
int pre[24][SZ];

int main() {
    dp[0][B] = 1;
    int N;
    cin >> N;
    V<int> A(N), ans(N);
    rep(i, N) { cin >> A[i]; }
    int now = 0;
    rep(i, min(N, 23)) {
        rep(j, SZ) {
            if (dp[i][j]) {
                if (j + A[i] < SZ) {
                    dp[i + 1][j + A[i]] = 1;
                    pre[i + 1][j + A[i]] = j;
                }
                if (dp[i + 1][j] == 0) {
                    dp[i + 1][j] = 1;
                    pre[i + 1][j] = j;
                }
                if (j - A[i] >= 0) {
                    dp[i + 1][j - A[i]] = 1;
                    pre[i + 1][j - A[i]] = j;
                }
            }
        }
        now++;
    }

    if (!dp[now][B]) {
        puts("No");
        return 0;
    }

    int p = now, v = B;
    bool ok = 0;
    rep(t, now) {
        int nx = pre[p][v];
        --p;
        if (nx < v) {
            ans[p] = 1;
            ok = 1;
        } else if (nx > v) {
            ans[p] = -1;
            ok = 1;
        } else {
            ans[p] = 0;
        }
        v = nx;
    }
    if (!ok) {
        puts("No");
        return 0;
    }

    puts("Yes");
    rep(i, N) { printf("%d%c", ans[i] * A[i], i == N - 1 ? '\n' : ' '); }

    return 0;
}