#include <ext/pb_ds/assoc_container.hpp> // >>> TEMPLATES #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1; auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1; auto constexpr INF = numeric_limits<int>::max()/2-1; #ifdef LOCAL #include "debug.hpp" #define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__) #define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl #define debug if (1) #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template <class T> using pque_max = priority_queue<T>; template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >; template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; } template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template <class F> struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward<F>(f)) {} template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); } }; struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template <class T, size_t d> struct vec_impl { using type = vector<typename vec_impl<T,d-1>::type>; template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); } }; template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } }; template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type; template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); } template <class T> void quit(T const& x) { cout << x << endl; exit(0); } template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); } template <class T> int sz(T const& x) { return x.size(); } template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(v.begin(), v.end(), x)-v.begin(); } template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(v.begin(), v.end(), x)-v.begin(); } template <class C, class F> int ppt(C const& v, F f) { return partition_point(v.begin(), v.end(), f)-v.begin(); } // <<< // https://codeforces.com/blog/entry/62393 struct custom_hash { static uint64_t splitmix64(uint64_t x) { // http://xorshift.di.unimi.it/splitmix64.c x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; // https://codeforces.com/blog/entry/60737 using namespace __gnu_pbds; template <class T, class U> using uo_map = gp_hash_table<T,U,custom_hash>; template <class T> using uos = gp_hash_table<T,null_type,custom_hash>; bool next_product(int m, vector<int> &v) { rep (i,v.size()) { if (++v[i] < m) return true; v[i] = 0; } return false; } int32_t main() { int n; cin >> n; vector<int> a(n); cin >> a; int m = 30; chmin(m,n); int m1 = m/2, m2 = m-m1; dump(m1,m2); uos<int> w; vector<int> v(m1); do { int sum = 0; rep (i,m1) sum += (v[i]-1)*a[i]; w.insert(sum); dump(m1,sum,v); if (count(all(v),1) != m1 && sum == 0) { cout << "Yes\n"; rep (i,m1) cout << (v[i]-1)*a[i] << " "; loop (i,m1,<n) cout << "0 "; cout << endl; return 0; } } while (next_product(3,v)); // sort(all(w)); dump(w); v.assign(m2,0); int memo_sum = INF; vector<int> ans(n); do { if (count(all(v),1) == m2) continue; int sum = 0; loop (i,m1,<m) sum += (v[i-m1]-1)*a[i]; dump(m2,sum,v); if (w.find(-sum) != w.end()) { memo_sum = sum; loop (i,m1,<m) ans[i] = (v[i-m1]-1)*a[i]; break; } } while (next_product(3,v)); dump(memo_sum); if (memo_sum == INF) quit("No"); v.assign(m1,0); do { int sum = 0; rep (i,m1) sum += (v[i]-1)*a[i]; dump(m1,sum,v); if (sum + memo_sum == 0) { cout << "Yes\n"; rep (i,m1) ans[i] = (v[i]-1)*a[i]; cout << ans << endl; return 0; } } while (next_product(3,v)); assert(0); }