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

typedef long long ll;

const int MOD = 1e9 + 7;

int sum[400000000];
int A[150001];
int B[150001];

void calc_sums(int a[], int L, int R)
{
    int pow3 = 1;
    for (int i = L; i < R; i++)
    {
        int x = A[i];
        for (int j = 0; j < pow3; j++)
        {
            a[j + pow3] = a[j] + x;
            a[j + pow3 + pow3] = a[j] - x;
        }
        pow3 *= 3;
    }
}

int main()
{
    int N;
    cin >> N;
    for (int i = 0; i < N; i++)
    {
        cin >> A[i];
    }
    int M = min(N, 19);
    int pow3 = 1;
    for (int i = 1; i < M; i++)
    {
        int x = A[i];
        for (int j = 0; j < pow3; j++)
        {
            sum[j + pow3] = sum[j] + x;
            sum[j + pow3 + pow3] = sum[j] - x;
        }
        pow3 *= 3;
    }
    int found = -1;
    for (int j = 1; j < pow(3, M - 1); j++)
    {
        if ((sum[j] == 0) || (sum[j] == A[0]) || (sum[j] == -A[0]))
        {
            cout << j << " " << sum[j] << endl;
            found = j;
            break;
        }
    }
    if (found == -1)
    {
        cout << "No" << endl;
        return 0;
    }
    int x = found;
    int n = 1;
    int coef[3] = {0, 1, -1};
    int S = 0;
    while (x)
    {
        B[n] = coef[x % 3] * A[n];
        S += B[n];
        x /= 3;
        n++;
    }
    B[0] = -S;
    cout << "Yes" << endl;
    for (int i = 0; i < N; i++)
    {
        if (i)
        {
            cout << " ";
        }
        cout << B[i];
    }
    cout << endl;
    return 0;
}