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

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i)  cin >> a[i];

    int m = min(n, 22);
    vector<int> sum(1 << m), cnt(150000 * m + 1);
    for(int mask = 0; mask < 1 << m; ++mask){
        for(int i = 0; i < m; ++i){
            if(mask >> i & 1)   sum[mask] += a[i];
        }
        cnt[sum[mask]] += 1;
    }

    int S = -1;
    for(int i = 1; i <= 150000 * m; ++i){
        if(cnt[i] > 1){
            S = i;
            break;
        }
    }
    if(S == -1){
        cout << "No\n";
        return 0;
    }

    int s = -1, t = -1;
    for(int mask = 0; mask < 1 << m; ++mask){
        if(sum[mask] != S)  continue;
        if(s == -1) s = mask;
        else    t = mask;
    }

    int andmask = s & t;
    s ^= andmask, t ^= andmask;

    for(int i = 0; i < m; ++i){
        if(s >> i & 1)  a[i] = a[i];
        else if(t >> i & 1) a[i] = -a[i];
        else    a[i] = 0;
    }
    for(int i = m; i < n; ++i)  a[i] = 0;

    cout << "Yes\n";
    for(int i = 0; i < n; ++i){
        cout << a[i] << (i == n - 1 ? '\n' : ' ');
    }

    return 0;
}