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 <iostream>
#include <algorithm>
using namespace std;
pair <int,int> a[1000005];
int ans[1000005];
int main(int argc, char** argv) {
	int n;
	cin >> n;
	for(int i=1;i<=n;i++)
	{
		cin >> a[i].first;
		a[i].second=i;
		ans[a[i].first]=a[i].second;
	}
	sort(a+1,a+n+1);
	int now=1,flag=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<a[i].second;j++)
		{
			while(ans[now]&&now<=500000) ++now;
			ans[now]=a[i].second;
		}
		if(now>a[i].first)
		{
			flag=1;
		}
	}
	int lst=now+1;
	now=n*n;
	for(int i=n;i>=1;i--)
	{
		for(int j=a[i].second+1;j<=n;j++)
		{
			while(ans[now]&&now>=0) --now;
			ans[now]=a[i].second;
		}
		//cout << i << " " << now << endl;
		if(now<a[i].first)
		{
			flag=1;
		}
	}
	for(int i=1;i<=n*n;i++)
	{
		if(!ans[i])
		{
			flag=1;
		}
	}
	if(flag)
	{
		puts("No");
		return 0;
	}
	puts("Yes"); 
	for(int i=1;i<=n*n;i++)
		cout << ans[i] << " ";
	return 0;
}