/* -*- coding: utf-8 -*-
 *
 * 1017.cc:  No.1017 Reiwa Sequence - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_M = 22;
const int MBITS = 1 << MAX_M;

/* typedef */

typedef long long ll;
typedef pair<ll,int> pli;

/* global variables */

int as[MAX_M];
pli ps[MBITS];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  int m = min(n, MAX_M);
  for (int i = 0; i < m; i++) scanf("%d", as + i);

  int mbits = 1 << m;
  for (int bits = 1, msb = 1, bi = 0; bits < mbits; bits++) {
    if ((msb << 1) <= bits) msb <<= 1, bi++;
    ps[bits].first = ps[bits ^ msb].first + as[bi];
    ps[bits].second = bits;
  }
  sort(ps, ps + mbits);

  for (int i = 0; i + 1 < mbits; i++)
    if (ps[i].first == ps[i + 1].first) {
      int bits0 = ps[i].second, bits1 = ps[i + 1].second;
      int msk = bits0 & bits1;
      bits0 ^= msk, bits1 ^= msk;

      puts("Yes");
      for (int j = 0, bj = 1; j < m; j++, bj <<= 1) {
	if (j) putchar(' ');
	int aj = 0;
	if (bits0 & bj) aj = as[j];
	else if (bits1 & bj) aj = -as[j];
	printf("%d", aj);
      }
      for (int j = m; j < n; j++) printf(" 0");
      putchar('\n');
      return 0;
    }

  puts("No");
  return 0;
}