Problem: 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

Solution (in JAVA):

Solution:

import java.util.Arrays;

public class Main {

  private static void solve() {
    int n = ni();
    int[] x = na(n);

    int[][] b = new int[n][2];
    int[] ret = new int[n * n];

    for (int i = 0; i < n; i++) {
      b[i][0] = i + 1;
      b[i][1] = x[i] - 1;
      ret[b[i][1]] = b[i][0];
    }
    Arrays.sort(b, (o1, o2) -> o1[1] - o2[1]);

    int p = 0;
    for (int i = 0; i < n; i++) {
      int m = b[i][0] - 1;
      for (int j = 0; j < m; j++) {
        while (p < n * n && ret[p] != 0) {
          p++;
        }
        ret[p] = b[i][0];
      }
    }
    p = n * n - 1;
    for (int i = n - 1; i >= 0; i--) {
      int m = n - b[i][0];
      for (int j = 0; j < m; j++) {
        while (p > 0 && ret[p] != 0) {
          p--;
        }
        ret[p] = b[i][0];
      }
    }

    for (int[] v : b) {
      int cnt = 0;
      for (int i = 0; i < n * n; i++) {
        if (v[0] == ret[i]) {
          cnt++;
        }
        if (cnt == v[0]) {
          if (i != v[1]) {
            System.out.println("No");
            return;
          } else {
            break;
          }
        }
      }
    }


    out.println("Yes");
    for (int i = 0; i < n * n; i++) {
      out.print(ret[i] + " ");
    }
    out.println();
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}