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;

int main() {
	int N;
	pair<int, int> P[500];
	static int ANS[250000] = {};
	int Cur = 0;
	cin >> N;
	for (int i = 0; i < N; i++) {
		int X;
		cin >> X;
		P[i] = { X - 1, i + 1 };
	}
	sort(P, P + N);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < P[i].second - 1; j++) {
			while (ANS[Cur] != 0) Cur++;
			ANS[Cur] = P[i].second;
		}
		if (ANS[P[i].first] != 0) {
			cout << "No" << endl;
			return 0;
		}
		ANS[P[i].first] = P[i].second;
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N - P[i].second; j++) {
			while (ANS[Cur] != 0) Cur++;
			if (Cur < P[i].first) {
				cout << "No" << endl;
				return 0;
			}
			ANS[Cur] = P[i].second;
		}
	}
	cout << "Yes" << endl;
	for (int i = 0; i < N * N; i++) {
		if (i != 0) cout << " ";
		cout << ANS[i];
	}
	cout << endl;
}