#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;

int N;
int A[2020];
int cnt[2020];
vp X;
int ans[555 * 555];

bool check() {
    bool flag = true;
    FOR(N * N) {
        int num = ans[i];
        cnt[ans[i]]++;
        if (cnt[num] == num) {
            if (i != A[num])
                flag = false;
        }
    }
    return flag;
}

void solve() {
    Fill(ans, -1);
    sort(all(X));
    queue<int> que_front;
    FOR(N) {
        itn num = X[i].second;
        FOR(a, num - 1) {
            que_front.push(num);
        }
    }
    queue<itn> que_back;
    for (int i = N - 1; i >= 0; i--) {
        itn num = X[i].second;
        FOR(a, N - num) {
            que_back.push(num);
        }
    }
    FOR(N) {
        ans[X[i].first] = X[i].second;
    }
    int idx = 0;
    while (!que_front.empty()) {
        itn num = que_front.front();
        que_front.pop();
        while (ans[idx] != -1)
            idx++;
        ans[idx] = num;
    }


    idx = N * N - 1;
    while (!que_back.empty()) {
        itn num = que_back.front();
        que_back.pop();
        while (ans[idx] != -1)
            idx--;
        ans[idx] = num;
    }
    bool flag = check();
    Yes(flag);
    if (flag) {
        FOR(N * N)
        cout << ans[i] << " ";
    }
    cout << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N;
    FOR(N) {
        int a;
        cin >> a;
        A[i + 1] = a - 1;
        X.pb({a - 1, i + 1});
    }

    solve();
    return 0;
}


Measured memory_bytes: 5632