Problem:
Score : 800 points

Problem Statement

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.

Sample Input 1

3
1 5 9

Sample Output 1

Yes
1 1 1 2 2 2 3 3 3

For example, the second occurrence of the integer 2 from the left in a in the output is the fifth element of a from the left.
Similarly, the condition is satisfied for the integers 1 and 3.

Sample Input 2

2
4 1

Sample Output 2

No

Solution in PyPy3 (2.4.0) (judge verdict: Wrong Answer)

import sys
N = int(input())
a = [-1]*N**2
x = list(map(int, input().split()))
x = list(zip(x, list(range(1, N+1))))
x.sort()
now = 0
for v, i in x:
    if a[v-1]>=0:
        print('No')
        sys.exit()
    a[v-1] = i
    cnt = 0
    while cnt < i-1:
        if now==v:
            print('No')
            sys.exit()
        if a[now]<0:
            a[now] = i
            cnt+=1
        now+=1
now = N-1
for v, i in reversed(x):
    cnt = 0
    while cnt<N-i:
        if now==v:
            print('No')
            sys.exit()
        if a[now]<0:
            a[now] = i
            cnt+=1
        now-=1
print('Yes')
print(*a)