#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> A(N - 1);
	REP(i, N - 1) scanf("%d", &A[i]);
	
	vector<int> ord(N - 1);
	iota(ALL(ord), 0);
	sort(ALL(ord), [&](int i, int j) { return A[i] < A[j]; });
	
	vector<int> ans(N - 1);
	REP(i, ord.size()) {
		const int v = i + 2;
		const int idx = ord[i];
		if (A[idx] >= v) { puts("NO"); return 0; }
		ans[idx] = v - A[idx];
	}
	
	puts("YES");
	for (int a : ans) printf("%d\n", a);
}