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 <algorithm>
#include <cstdio>
int x[505],id[505],ans[250005];
bool cmp(int a,int b){return x[a]<x[b];}
int main(){
	int n;bool flag=1;
	scanf("%d\n",&n);
	for (int i=1;i<=n;i++){
		scanf("%d",&x[i]);
		if (!ans[x[i]]) ans[x[i]]=i;
			else flag=0;
		id[i]=i;
	}
	std::sort(id+1,id+n+1,cmp);
	for (int i=1,j=1;i<=n && flag;i++){
		for (int k=1;k<id[i];j++)
			if (!ans[j]) ans[j]=id[i],k++;
		if (j>x[id[i]]) flag=0;
	}
	for (int i=n,j=n*n;i>=1 && flag;i--){
		for (int k=id[i];k<n;j--)
			if (!ans[j]) ans[j]=id[i],k++;
		if (j<x[id[i]]) flag=0;
	}
	if (flag){
		printf("Yes\n");
		for (int i=1;i<=n*n;i++) printf("%d ",ans[i]);
	}
	else printf("No\n");
}