You are given an integer sequence x of length N. Determine if there exists an integer sequence a that satisfies all of the following conditions, and if it exists, construct an instance of a.

* a is N^2 in length, containing N copies of each of the integers 1, 2, ..., N.
* For each 1 ≤ i ≤ N, the i-th occurrence of the integer i from the left in a is the x_i-th element of a from the left.

Constraints

* 1 ≤ N ≤ 500
* 1 ≤ x_i ≤ N^2
* All x_i are distinct.

Input

The input is given from Standard Input in the following format:


N
x_1 x_2 ... x_N


Output

If there does not exist an integer sequence a that satisfies all the conditions, print `No`. If there does exist such an sequence a, print `Yes` in the first line, then print an instance of a in the second line, with spaces inbetween.

Examples

Input

3
1 5 9


Output

Yes
1 1 1 2 2 2 3 3 3


Input

2
4 1


Output

No
#include<cstdio>
#include<algorithm>
int N,x[510],ls[510],rs[510],a[510*510],L[510];
bool cmp(int i,int j){return x[i]<x[j];}
bool solve(){
	for(int i=1;i<=N;i++)a[--x[i]]=i,L[i-1]=i;
	std::sort(L,L+N,cmp);
	for(int i=0;i<N;i++){
		ls[L[i]]=x[L[i]]-i;
		rs[L[i]]=N*N-N-x[L[i]]+i;
	}
	int pos=0;
	for(int t=0;t<2;t++){
		for(int*i=L;i<L+N;i++){
			for(int j=t?N-*i:*i-1;j--;){
				while(a[pos])pos++;
				if(t==(pos<x[*i]))return 0;
				a[pos++]=*i;
			}
		}
	}
	return 1;
}
int main(){
	scanf("%d",&N);
	for(int i=1;i<=N;i++)scanf("%d",x+i);
	if(solve()){
		puts("Yes");
		for(int i=0;i<N*N;i++)printf("%d%c",a[i]," \n"[i==N*N-1]);
	}
	else puts("No");
}