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<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int x[505];
int t[505];
int ans[252525];
int cnt[505];
int mk[252525];
bool cmp(const int &a,const int &b)
{
	return x[a]<x[b];
}
int n,nn;
bool jud()
{
	memset(cnt,0,sizeof(cnt));
	for(int i=1;i<=nn;i++)
	{
		cnt[ans[i]]++;
		if(mk[i])
			if(mk[i]!=ans[i]||cnt[ans[i]]!=mk[i])
				return false;
	}
	return true;
}
int main()
{
	int now=1,nd;
	scanf("%d",&n);
	nn=n*n;
	memset(ans,0,sizeof(ans));
	memset(mk,0,sizeof(mk));
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x[i]);
		ans[x[i]]=i;
		mk[x[i]]=i;
		t[i]=i;
	}
	sort(t+1,t+1+n,cmp);
	for(int i=1;i<=n;i++)
	{
		nd=t[i]-1;
		while(nd)
		{
			while(ans[now])
				now++;
			ans[now]=t[i];
			nd--;
		}
	}
	for(int i=1;i<=n;i++)
	{
		nd=n-t[i];
		while(nd)
		{
			while(ans[now])
				now++;
			ans[now]=t[i];
			nd--;
		}
	}
	if(jud())
	{
		printf("Yes\n");
		for(int i=1;i<=nn;i++)
			printf("%d ",ans[i]);
	}
	else
		printf("No");
	return 0;
}