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 <iostream>
#include <cstdlib>

using namespace std;

#define MAXN 500

int ans[MAXN * MAXN + 1], u[MAXN * MAXN + 1], v[MAXN + 1];

inline void gata() {
    cout << "No\n";
    exit(0);
}

int main() {
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> v[i];
        u[v[i]] = i;
    }

    int st = 1;
    for (int i = 1; i <= n * n; i++) if (u[i]) {
        int cnt = u[i] - 1;
        while (st < i && cnt > 0) {
            if (ans[st] == 0) ans[st] = u[i], cnt--;
            st++;
        }

        if (cnt > 0)
            gata();

        ans[i] = u[i];
    }

    int dr = n * n;
    for (int i = n * n; i > 0; i--) if (u[i]) {
        int cnt = n - u[i];
        while (dr > i && cnt > 0) {
            if (ans[dr] == 0) ans[dr] = u[i], cnt--;
            dr--;
        }

        if (cnt > 0)
            gata();
    }

    cout << "Yes\n";
    for (int i = 1; i <= n * n; i++)
        cout << ans[i] << ' ';

    return 0;
}
