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
N = int(input())
X = list(map(int, input().split()))
A = [-1]*N*N
sorted_X = sorted(X)
first_empty = 0
last_empty = N*N-1
fail_flag = 0
for i in range(N):
	x = sorted_X[i]
	K = X.index(x)+1
	if A[x-1]==-1:
		A[x-1] = K
	else:
		print("No")
		fail_flag = 1
		break
	K_rest = K-1
	while K_rest>0:
		while True:
			if A[first_empty]==-1:
				break
			first_empty = first_empty+1
		if first_empty<x-1:
			A[first_empty] = K
			K_rest = K_rest-1
			first_empty = first_empty+1
		else:
			print("No")
			fail_flag = 1
			break
	if fail_flag==1:
		break

if fail_flag==0:
	for i in range(N-1,-1,-1):
		x = sorted_X[i]
		K = X.index(x)+1
		K_rest = N-K
		while K_rest>0:
			while True:
				if A[last_empty]==-1:
					break
				last_empty = last_empty-1
			if last_empty>x-1:
				A[last_empty] = K
				K_rest = K_rest-1
				last_empty = last_empty-1
			else:
				print("No")
				fail_flag = 1
				break
		if fail_flag==1:
			break

if fail_flag==0:
	print("Yes")
	for a in A:
		print(str(a), end=" ")