#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long int ll;
using pii = pair<int, int>;
const int maxn = 1e6 + 10;
constexpr int mod = 1e9 + 7;
int d[25][25], f[maxn], a[maxn], n, s[maxn];
inline int ck() {
	for (int i = 1; i <= n; i++) s[i] = 0;
	for (int i = 1; i < n; i++) {
		d[i][i] = f[i];
		for (int j = i + 1; j < n; j++) d[i][j] = min(d[i][j - 1], f[j]);
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j < i; j++) s[i] += d[j][i - 1];
		for (int j = i; j < n; j++) s[i] += d[i][j];
		if (s[i] != a[i]) return 0;
	}
	return 1;
}
void dfs(int u) {
	if (u == n) {
		if (ck()) {
			puts("Yes");
			for (int i = 1; i < n; i++) printf("%d ", f[i]);
			exit(0);
		}
		return;
	}
	for (int i = 1; i <= 20; i++) f[u] = i, dfs(u + 1);
}
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	dfs(1);
	puts("No");
	return 0;
}