#include <bits/stdc++.h>

#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)

using namespace std;

const int N = 510;

struct Number{
	int o, x;

	bool operator < (const Number& A) const{
		return x < A.x;
	}
}A[N];

int n;
int P[N * N];

int main(){
	
	scanf("%d", &n);
	For(i, 1, n) scanf("%d", &A[i].x), A[i].o = i;
	sort(A + 1, A + n + 1);

	int pos = 1;
	For(i, 1, n){
		P[A[i].x] = A[i].o;
		For(j, 1, A[i].o - 1){
			while(P[pos]) ++pos;
			P[pos] = A[i].o;
		}

		if(pos > A[i].x){
			puts("No");
			return 0;
		}
	}

	pos = n * n;
	Forr(i, n, 1){
		For(j, A[i].o + 1, n){
			while(P[pos]) --pos;
			P[pos] = A[i].o;
		}

		if(pos < A[i].x){
			puts("No");
			return 0;
		}
	}

	puts("Yes");
	For(i, 1, n * n) printf("%d%c", P[i], i == n * n ? '\n' : ' ');
	return 0;
}