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<iostream>
#include<algorithm>
using namespace std;
const int N=501;
int a[501*501],X[501];
int c[N],cnt[N];
int pos[N][N],num[N];
int n;
bool cmp(int a,int b)
{
	return X[a]<X[b];
}
bool check()
{
    for(int i=1;i<=n*n;i++)
        pos[a[i]][++num[a[i]]]=i;
    for(int i=1;i<=n;i++)
        if(pos[i][i]!=X[i]) return false;
    return true;
}

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++) 
		cin>>X[i],c[i]=i,a[X[i]]=i,cnt[i]=i-1;
    sort(c+1,c+1+n,cmp);
    for(int i=1;i<=n*n;i++)
        if(!a[i])
	        for(int j=1;j<=n;j++)
	            if(cnt[c[j]])
	            {
					a[i]=c[j];cnt[c[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[c[j]])
				{
					a[i]=c[j];cnt[c[j]]--;break;
				}
    if(check())
    {
        cout<<"Yes\n";
        for(int i=1;i<=n*n;i++)
            cout<<a[i]<<" ";
    }
    else cout<<"No";
    return 0;
}