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=505;
int n;
int ans[N*N];
struct number{int x,id;}num[N];

inline bool cmp(number a,number b){return a.x<b.x;}

int main(){
	scanf("%d",&n);
	for (register int i=1; i<=n; ++i) scanf("%d",&num[i].x),num[i].id=i;
	sort(num+1,num+n+1,cmp);
	
	int now=1;
	for (register int i=1; i<=n; ++i)
	{
		ans[num[i].x]=num[i].id;
		for (register int j=1; j<num[i].id; ++j)
		{
			while (ans[now]) 
			{
				if (now==num[i].x)
				{
					puts("No");
					return 0;	
				}
				now++;
			}
			ans[now]=num[i].id;
		}
	}
	now=n*n;
	for (register int i=n; i>=1; --i)
	{
		for (register int j=n; j>num[i].id; --j)
		{
			while (ans[now])
			{
				if (now==num[i].x)
				{
					puts("No");
					return 0;
				}
				now--;	
			}
			ans[now]=num[i].id;
		}
	}
	
	puts("Yes");
	for (register int i=1; i<=n*n; ++i) printf("%d ",ans[i]); 
return 0;
}