#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int, int>P;

P x[500];
int a[250000];
int main() {
	int n; scanf("%d", &n);
	rep(i, n) {
		scanf("%d", &x[i].first);
		a[--x[i].first] = i + 1;
		x[i].second = i + 1;
	}
	sort(x, x + n);
	int s = 0;
	rep(i, n) {
		rep(j, x[i].second - 1) {
			while (s < x[i].first&&a[s] != 0)s++;
			if (s == x[i].first) {
				puts("No"); return 0;
			}
			a[s] = x[i].second;
		}
	}
	s = 0;
	rep(i, n) {
		s = max(s, x[i].first + 1);
		rep(j, n - x[i].second) {
			while (s < n*n&&a[s] != 0)s++;
			if (s == n*n) {
				puts("No"); return 0;
			}
			a[s] = x[i].second;
		}
	}
	puts("Yes");
	rep(i, n*n) {
		if (i)printf(" ");
		printf("%d", a[i]);
	}
	puts("");
}