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 <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <set>
#define MAXN 300000
int n, m, k, x[MAXN], id[MAXN], ans[MAXN], sum[MAXN];
int main() {
	scanf("%d", &n);
	m = n * n;
	for (int i = 1; i <= n; i++) {
		scanf("%d", &x[i]);
		id[i] = ans[x[i]] = i;
	}
	std::sort(id + 1, id + n + 1, [](int a, int b) { return x[a] < x[b]; });
	for (int i = 1, cur = 1; i <= n; i++) {
		for (int j = 1; j < id[i]; j++) {
			while (ans[cur]) cur++;
			ans[cur] = id[i];
		}
		if (cur > x[id[i]]) return puts("No"), 0;
	}
	for (int i = n, cur = m; i >= 1; i--) {
		for (int j = id[i] + 1; j <= n; j++) {
			while (ans[cur]) cur--;
			ans[cur] = id[i];
		}
		if (cur < x[id[i]]) return puts("No"), 0;
	}
	puts("Yes");
	for (int i = 1; i <= m; i++) printf("%d%c", ans[i], " \n"[i == m]);
	return 0;
}
