#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

struct Solver {
    using bs_type = std::bitset<100>;
    ll n;
    vec<ll> vn, ans;
    std::map<ll, bs_type> sums;

    Solver(ll n) : n(n), vn(n), ans(n) {
        for (ll &e : vn) std::cin >> e;
    }

    bool dfs(ll idx, ll sum, bs_type used) {
        if (idx == n) return false;
        if (vn[idx] == 0) return dfs(idx + 1, sum, used);
        sum += vn[idx];
        used.set(idx, 1);
        auto ite = sums.find(sum);
        if (ite != sums.end()) {
            auto found = ite->second;
            auto band = found & used;
            found ^= band;
            used ^= band;
            for (ll i = 0; i < n; i++) {
                if (found.test(i)) ans[i] = vn[i];
                if (used.test(i)) ans[i] = -vn[i];
            }
            return true;
        }
        sums[sum] = used;
        if (dfs(idx + 1, sum, used)) return true;
        sum -= vn[idx];
        used.set(idx, 0);
        if (dfs(idx + 1, sum, used)) return true;
        return false;
    }

    bool check() {
        std::map<ll, tll> mp;
        tll err(-1, -1, -1);

        auto add_mp = [&](ll key, tll val) {
            auto ite = mp.find(key);
            if (ite != mp.end()) return ite->second;
            mp[key] = val;
            return err;
        };

        auto build = [&](tll s, tll t) {
            ll a, b, c, d, e, f;
            std::tie(a, b, c) = s;
            std::tie(d, e, f) = t;
            vec<ll> sl = { a, b, f, };
            vec<ll> tl = { c, d, e, };
            for (ll i = 0; i < 3; i++) for (ll j = i + 1; j < 3; j++) {
                if (sl[i] == sl[j]) return false;
                if (tl[i] == tl[j]) return false;
            }
            vec<ll> all = { a, b, c, d, e, f, };
            for (ll i = 0; i < sl.size(); i++) if (sl[i] == -1) sl.erase(sl.begin() + i);
            for (ll i = 0; i < tl.size(); i++) if (tl[i] == -1) tl.erase(tl.begin() + i);
            for (ll e : all) {
                auto ites = std::find(ALL(sl), e);
                auto itet = std::find(ALL(tl), e);
                if (ites != sl.end() && itet != tl.end()) {
                    sl.erase(ites);
                    tl.erase(itet);
                }
            }
            for (ll e : sl) ans[e] = vn[e];
            for (ll e : tl) ans[e] = -vn[e];
            return true;
        };

        for (ll i = 0; i < n; i++) for (ll j = i + 1; j < n; j++) {
            if (vn[i] == vn[j]) {
                ans[i] = vn[i];
                ans[j] = -vn[j];
                return true;
            }

            for (ll k = j + 1; k <= n; k++) {
                ll key = vn[i] - vn[j];
                if (k < n) key += vn[k];
                tll val(i, (k < n ? k : -1), j);
                auto res = add_mp(key, val);
                if (res != err) if (build(val, res)) return true;
            }
        }

        return dfs(0, 0, bs_type());
    }

    auto solve() {
        bool res = check();
        return std::make_pair(res, ans);
    }
};

int main() {
    ll n;
    std::cin >> n;
    Solver solver(n);
    bool ok;
    vec<ll> ans;
    std::tie(ok, ans) = std::move(solver.solve());
    if (ok) {
        std::cout << "Yes\n";
        for (ll i = 0; i < n; i++) std::cout << ans[i] << " \n"[i + 1 == n];
    } else {
        std::cout << "No\n";
    }
    return 0;
}