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 <utility>
#include <algorithm>

using namespace std;

int i,j,n,x[510],a[300000],b[300000],y[510];
pair<int,int> p[510];
int main(){
	cin >> n;
	for(i=1;i<=n;i++){
		cin >> x[i];
		a[x[i]] = i;
		b[x[i]] = 1;
		y[i]=n-i;
		p[i]=make_pair(x[i],i);
	}
	
	for(i=1;i<=n*n;i++){
		if(b[i]==1){
			int cnt = a[i]-1;
			for(j=1;j<=i;j++){
				if(cnt==0){
					break;
				}
				if(b[j]==0){
					a[j] = a[i];
					b[j] = 1;
					cnt--;
				}
				if(j==i){
					cout << "No" << endl;
					return 0;
				}
			}
		}
	}
	sort(p,p+n);
	for(i=1;i<=n*n;i++){
		if(b[i]==0){
			for(j=1;j<=n;j++){
				if(y[p[j].second]!=0){
					y[p[j].second]--;
					a[i]=p[j].second;
					b[i]=1;
					break;
				}
			}
		}
	}
	for(i=1;i<=n*n;i++){
		b[i]=0;
	}
	for(i=1;i<=n*n;i++){
		b[a[i]]++;
		if(b[a[i]]==a[i]){
			if(i!=x[a[i]]){
				cout << "No" << endl;
				return 0;
			}
		}
	}
	
	cout << "Yes" << endl;
	for(i=1;i<=n*n;i++){
		cout << a[i] << " ";
	}
	cout << endl;
}
	