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
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
import java.io.*;

public class Main {



    public static void main(String[] args) throws Exception {
        IO io = new IO(null, null);
        int n = io.getNextInt();
        int [] X = new int[n+1];
        for (int i = 1;i <= n;i++)
            X[i] = io.getNextInt();
        int [] A = new int[n*n+1];
        for (int i = 1;i <= n;i++)
            A[X[i]] = i;
        boolean can = true;
        Deque<Integer> dq = new ArrayDeque<>();
        for (int i = A.length-1;i > 0 && can;i--){
            if (A[i] != 0)
                for (int j = 0;j < A[i]-1;j++)
                    dq.addFirst(A[i]);
        }
//        System.err.println(can);
//        System.err.println(Arrays.toString(A));
        for (int i = 1;i < A.length && can;i++) {
            if (A[i] == 0) {
                if (dq.isEmpty()) can = false;
                else A[i] = dq.pollFirst();
            }
            else {
                for (int j = A[i];j < n;j++)
                    dq.addLast(A[i]);
            }
        }
//        System.err.println(Arrays.toString(A));
        HashMap<Integer,Integer> HM = new HashMap<>();
        int [] C = new int[n*n+1];
        for (int i = 1;i <= n;i++) HM.put(i,0);
        for (int i = 1;i < A.length && can;i++){
            HM.put(A[i],HM.get(A[i]) + 1);
            C[i] = HM.get(A[i]);
        }
//        System.err.println(Arrays.toString(C));
        for (int i = 1;i <= n && can;i++)
            can &= C[X[i]] == i;
        if (can) {
            io.println("Yes");
            for (int i = 1;i < A.length;i++)
                io.print(A[i] + " ");
        }
        else io.println("No");
        io.close();
    }
}


class IO{
    private BufferedReader br;
    private StringTokenizer st;
    private PrintWriter writer;
    private String inputFile,outputFile;

    public boolean hasMore() throws IOException{
        if(st != null && st.hasMoreTokens()) return true;
        if(br != null && br.ready()) return true;
        return false;
    }

    public String getNext() throws FileNotFoundException, IOException{
        while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

    public String getNextLine() throws FileNotFoundException, IOException{
        return br.readLine().trim();
    }

    public int getNextInt() throws FileNotFoundException, IOException{
        return Integer.parseInt(getNext());
    }
    public long getNextLong() throws FileNotFoundException, IOException{
        return Long.parseLong(getNext());
    }

    public void print(double x,int num_digits) throws  IOException{
        writer.printf("%." + num_digits + "f" ,x);
    }
    public void println(double x,int num_digits) throws  IOException{
        writer.printf("%." + num_digits + "f\n" ,x);
    }
    public void print(Object o) throws  IOException{
        writer.print(o.toString());
    }

    public void println(Object o) throws  IOException{
        writer.println(o.toString());
    }
    public IO(String x,String y) throws FileNotFoundException, IOException{
        inputFile = x;
        outputFile = y;
        if(x != null) br = new BufferedReader(new FileReader(inputFile));
        else br = new BufferedReader(new InputStreamReader(System.in));
        if(y != null) writer = new PrintWriter(new BufferedWriter(new FileWriter(outputFile)));
        else writer = new PrintWriter(new OutputStreamWriter(System.out));
    }

    protected void close() throws IOException{
        br.close();
        writer.close();
    }
    public void outputArr(Object [] A) throws IOException{
        int L = A.length;
        for (int i = 0;i < L;i++) {
            if(i > 0) writer.print(" ");
            writer.print(A[i]);
        }
        writer.print("\n");
    }
}