#include <bits/stdc++.h>
using namespace std;
#define lor(a,b,c) for(register int a=b;a<=c;++a)
#define ror(a,b,c) for(register int a=c;a>=b;--a)

const int N=505;

int n,x[N],y[N*N],z,cnt[N]; bool vis[N];
struct data {int pos,id;};
inline bool operator < (data a,data b) {return a.pos>b.pos;}
priority_queue <data> line;

int main(){
	scanf("%d",&n); lor(i,1,n) scanf("%d",&x[i]);
	lor(i,1,n) y[x[i]]=i; lor(i,1,n) lor(j,1,i-1) line.push((data){x[i],i});
	lor(i,1,n*n){
		z=i;
		if(y[i]){
			if(cnt[y[i]]!=y[i]-1) {return puts("No"),0;}
			else vis[y[i]]=true;
		}
		else if(!line.empty()){
			data tmp=line.top(); line.pop(); y[i]=tmp.id; cnt[tmp.id]++;
		}
		else {--z; break;}
	}
	lor(i,1,n) cnt[i]=n-i;
	lor(i,z+1,n*n){
		if(y[i]) vis[y[i]]=true;
		else{
			int ch=0;
			lor(j,1,n) if(cnt[j]&&vis[j]) {ch=j; cnt[ch]--; y[i]=ch; break;}
			if(!ch) return puts("No"),0;
		}
	}
	puts("Yes");
	lor(i,1,n*n) printf("%d ",y[i]); puts("");

	return 0;
}
