#include <cstdio>
#include <algorithm>
inline int Get() {
	char ch;
	while ((ch = getchar()) < '0' || ch > '9');
	int Num = ch - '0';
	while ((ch = getchar()) >= '0' && ch <= '9')
		Num = (Num << 3) + (Num << 1) + ch - '0';
	return Num;
}
const int N = 505;
int n, a[N], g[N * N], id[N], cur;
inline bool cmp(const int &x, const int &y) {
	return a[x] < a[y];
}
int main() {
	n = Get();
	for (int i = 1; i <= n; ++i) a[i] = Get(), id[i] = i;
	
	std :: sort(id + 1, id + n + 1, cmp);
	cur = 1;
	for (int i = 1, k; k = id[i], i <= n; ++i) {
		for (int j = 1; j < k; ++j) {
			while (g[cur]) ++cur;
			g[cur] = k;
		}
		
		if (cur > a[k] || g[a[k]]) {
			puts("No");
			return 0;
		}
		
		g[a[k]] = k;
	}
	
	for (int i = 1, k; k = id[i], i <= n; ++i) {
		for (int j = 1; j <= n - k; ++j) {	
			while (g[cur]) ++cur;
			if (cur < a[k]) {
				puts("No");
				return 0;
			}
			g[cur] = k;
		}
	}
	
	puts("Yes");
	for (int i = 1; i <= n * n; ++i) printf("%d ", g[i]);
}