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 <cstdio>
#include <algorithm>
#define repu(i,x,y) for (int i=x; i<=y; ++i)
using namespace std;

int n,p[510],a[510],cnt[510],ans[250100];

bool cmp(int x,int y)
{
    return p[x]<p[y];
}

bool solve()
{
    for (int i=1,j=1,k=1; i<=n*n; ++i)
        if (!ans[i])
        {
            for (; j<=n && cnt[a[j]]+1>=a[j]; ++j);
            for (; cnt[a[k]]==n; ++k);
            if (j<=n)
                ++cnt[ans[i]=a[j]];
            else
            {
                if (k==j)
                    return 0;
                ++cnt[ans[i]=a[k]];
            }
        }
        else
            if (++cnt[ans[i]]!=ans[i])
                return 0;
    return 1;
}

int main()
{
    scanf("%d",&n);
    repu(i,1,n)
        scanf("%d",&p[i]),ans[p[i]]=a[i]=i;
    sort(a+1,a+1+n,cmp);
    if (solve())
    {
        puts("Yes");
        repu(i,1,n*n)
            printf("%d ",ans[i]);
    }
    else
        puts("No");
    return 0;
}