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.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] x = new int[n];
		int[] array = new int[n * n];
		int[] ref = new int[n * n];
		for (int i = 0; i < n; ++i) {
			x[i] = sc.nextInt();
			array[x[i] - 1] = i + 1;
			ref[x[i] - 1] = i + 1;
		}

		int pos = 0;
		for (int i = 0; i < n * n; ++i) {
			if (ref[i] > 0) {
				int cnt = 0;
				while (cnt < array[i] - 1) {
					if (array[pos] == 0) {
						array[pos] = array[i];
						++cnt;
					}
					++pos;
				}
			}
		}
		pos = n * n - 1;
		for (int i = n * n - 1; i >= 0; --i) {
			if (ref[i] > 0) {
				int cnt = 0;
				while (cnt < n - array[i]) {
					if (array[pos] == 0) {
						array[pos] = array[i];
						++cnt;
					}
					--pos;
				}
			}
		}

		for (int i = 0; i < n * n; ++i) {
			if (ref[i] > 0) {
				int cnt = 0;
				for (int j = 0; j < i; ++j) {
					if (array[j] == ref[i]) {
						++cnt;
					}
				}
				if (cnt != ref[i] - 1) {
					System.out.println("No");
					return;
				}
				for (int j = i + 1; j < n * n; ++j) {
					if (array[j] == ref[i]) {
						++cnt;
					}
				}
				if (cnt != n - 1) {
					System.out.println("No");
					return;
				}
			}
		}
		System.out.println("Yes");
		for (int i = 0; i < n * n; ++i) {
			System.out.print(array[i] + (i == n * n - 1 ? "\n" : " "));
		}

	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}