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;
const int N = 500 * 500 + 5;
int n, x[N], c[N], id[N], a[N];
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i) scanf("%d", &x[i]), id[i] = i;
	sort(id + 1, id + n + 1, [](int a, int b) { return  x[a] < x[b]; });
	for(int i = 1, p = 1; i <= n; ++i) {
		for(int j = p; j < x[id[i]] && c[id[i]] < id[i] - 1; ++j, p = j)
			if (!a[p]) a[p] = id[i], c[id[i]]++;
		if (id[i] - 1 == c[id[i]] && x[id[i]] >= p) a[x[id[i]]] = id[i];
	}
	int flag = true;
	for(int i = 1; i <= n; ++i) flag &= a[x[i]] == i, flag &= c[i] == i - 1;
	if (!flag) { printf ("No\n"); return 0; }
	for(int i = n, p = n * n; i >= 1; --i) for(int j = p; j > x[id[i]] && c[id[i]] < n - 1; --j, p = j) {
		if (!a[p]) a[p] = id[i], c[id[i]]++;
	}
	flag = true;
	for(int i = 1; i <= n; ++i) flag &= c[i] == n - 1;
	if (!flag) { printf ("No\n"); return 0; }
	printf("Yes\n");
	for(int j = 1; j <= n * n; ++j) printf("%d%c", a[j], " \n"[j == n * n]);
	return 0;
}