#include <iostream>
#include <algorithm>
#include <vector>

constexpr int X = 4000000;

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    int m = std::min(n, 22);
    std::vector<int> idxs(X, -1), ss(n, 0);
    bool ok = false;

    for (int b = 0; b < (1 << m); ++b) {
        int s = 0;
        for (int i = 0; i < m; ++i) {
            if ((b >> i) & 1) s += xs[i];
        }

        if (idxs[s] == -1) {
            idxs[s] = b;
        } else {
            for (int i = 0; i < m; ++i) {
                if ((idxs[s] >> i) & 1) ss[i] = 1;
            }
            for (int i = 0; i < m; ++i) {
                if ((b >> i) & 1) {
                    ss[i] = (ss[i] == 1 ? 0 : -1);
                }
            }

            ok = true;
            break;
        }
    }

    if (!ok) {
        std::cout << "No" << std::endl;
    } else {
        std::cout << "Yes" << std::endl;
        for (int i = 0; i < n; ++i) std::cout << xs[i] * ss[i] << " ";
        std::cout << std::endl;
    }
}

int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}