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<bits/stdc++.h>
using namespace std;
typedef long long LL;
int read()
{
    char c=getchar();int f=1,sum=0;
    while(c<'0' || c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0' && c<='9'){sum=sum*10+c-'0';c=getchar();}
    return sum*f;
}
int n,tot;
int a[505*505],b[505],cnt[505],x[505];
int main()
{
	n=read();
	for(int i=1;i<=n;i++) a[x[i]=read()]=i;
	for(int i=1;i<=n*n;i++) if(a[i]) b[++tot]=a[i];
	for(int i=1;i<=n;i++) cnt[i]=i-1;
	for(int i=1;i<=n*n;i++)if(!a[i])for(int j=1;j<=n;j++)if(cnt[b[j]]){a[i]=b[j];cnt[b[j]]--;break;}
	for(int i=1;i<=n;i++) cnt[i]=n-i;
	for(int i=n*n;i>=1;i--)if(!a[i])for(int j=n;j>=1;j--)if(cnt[b[j]]){a[i]=b[j];cnt[b[j]]--;break;}
	bool flag=1;
	for(int i=1,num=0,j;i<=n;i++,num=0)
	{
		for(j=1;j<=n*n;j++) if(a[j]==i){num++;if(num==i) break;}
		if(j!=x[i]){flag=0;break;}
	}
	puts(flag?"Yes":"No");
	if(flag) for(int i=1;i<=n*n;i++) printf("%d ",a[i]);
	return 0;
}
