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;

int N,ans[251000] = {0};
pair<int,int> X[510];
int main(){
	cin >> N;
	int x;
	for(int i=1;i<=N;i++){
		cin >> x;
		X[i] = {x,i};
		ans[x] = i;
	}
	sort(X+1,X+N+1);
	int id = 1;
	bool judge = true;
	for(int i=1;i<=N;i++){
		int count = 0;
		while(count<X[i].second-1){
			if(ans[id]==0){
				ans[id] = X[i].second;
				count++;
			}
			id++;
		}
	}
	id = N*N;
	for(int i=N;i>=1;i--){
		int count = 0;
		while(count<N-X[i].second){
			if(ans[id]==0){
				ans[id] = X[i].second;
				count++;
			}
			id--;
		}
	}
	int c[510] = {0},num = 1;
	for(int i=1;i<=N*N;i++){
		c[ans[i]]++;
		if(i==X[num].first){
			if(c[X[num].second]!=X[num].second) judge = false;
			num++;
		}
	}
	if(!judge){
		cout << "No" << endl;
		return 0;
	}
	cout << "Yes" << endl;
	for(int i=1;i<=N*N;i++){
		cout << ans[i] << (i!=N*N? " ":"\n");
	}
}
