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;
using pii = pair<int, int>;

int main()
{
	int N;
	cin >> N;
	vector<int> x(N), a(N * N, -1);
	priority_queue<pii, vector<pii>, greater<pii>> pq;
	for (int i = 0; i < N; i++) {
		cin >> x[i]; --x[i];
		a[x[i]] = i;
		for (int j = 0; j < N - 1; j++) {
			if (j < i) {
				pq.emplace(x[i] - 1, i);
			}
			else {
				pq.emplace(N * N + x[i] - 1, i);
			}
		}
	}
	bool ng = false;
	for (int i = 0; i < N * N; i++) if (a[i] == -1) {
		auto p = pq.top(); pq.pop();
		if (p.first < i) {
			ng = true;
			break;
		}
		a[i] = p.second;
	}
	if (ng) {
		cout << "No" << endl;
		return 0;
	}
	vector<vector<int>> pos(N);
	for (int i = 0; i < N * N; i++) {
		pos[a[i]].push_back(i);
	}
	for (int i = 0; i < N; i++) {
		if (pos[i][i] != x[i]) {
			ng = true;
			break;
		}
	}
	if (ng) {
		cout << "No" << endl;
		return 0;
	}
	cout << "Yes" << endl;
	for (int i = 0; i < N * N; i++) {
		printf("%d%c", a[i] + 1, " \n"[i + 1 == N * N]);
	}
	return 0;
}
