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;

#define FOE(i, s, t) for (int i = s; i <= t; i++)
#define FOR(i, s, t) for (int i = s; i < t; i++)
#define FOD(i, s, t) for (int i = s; i >= t; i--)

#define LL long long
#define mp make_pair
#define pb push_back

#define K 601

int n, a[K], cnt[K];
int b[K * K];
int nid[K], pass[K];

int main() {
	scanf("%d", &n);
	FOE(i, 1, n) scanf("%d", &a[i]);
	FOE(i, 1, n) b[a[i]] = i;
	FOE(i, 1, n) nid[i] = i - 1, pass[i] = 0;

	FOE(i, 1, n * n) {
		if (b[i] != 0) {
			int tar = b[i];
			if (nid[tar] > 0) {
				puts("No");
				return 0;
			}
			
			pass[tar] = n - tar;
		} else {
			int ptr = 0;
			FOE(j, 1, n) if (nid[j] > 0 && (ptr == 0 || a[ptr] > a[j])) ptr = j;
			
			if (ptr) {
				nid[ptr]--;
				b[i] = ptr;
				
			} else {
				FOE(j, 1, n) if (pass[j] > 0) {
					ptr = j;
				}
				
				if (!ptr) {
					puts("No");
					return 0;	
				}
				
				pass[ptr]--;
				b[i] = ptr;
			}
		}
	}

	puts("Yes");
	FOE(i, 1, n * n) printf("%d ", b[i]);
	puts("");
}