#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;
using ll = long long;
using ull = unsigned long long;

constexpr ll INF = 1'000'000'000'000'000'000;
namespace utils{
#define ALL(x) begin(x), end(x)
#define rALL(x) rbegin(x), rend(x)
    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> bool min_update(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> bool max_update(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }
    using V_Set = unordered_set<int>;
    using E_Set = unordered_map<int, V_Set>;

    ll operator"" _64(unsigned long long x){ return ll(x); }
    ull operator"" _64u(unsigned long long x){ return ull(x); }

    template<class T>
    vector<T> make_vector(int n, T t){
        return vector<T>(n, t);
    }
    template<class ...Ts>
    auto make_vector(int n, Ts ... ts){
        return vector<decltype(make_vector(ts...))>(n, make_vector(ts...));
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<T>& v){
        for (auto &&x : v) { os << x << ' '; } cout << endl; return os ;
    }
}
using namespace utils;

class solver{
    istream& is;
    ostream& os;

public:
    solver(istream& I, ostream& O) :is(I), os(O) {}

    bool solve(){

    }

    void run(){
        ll N;
        is >> N;
        if(!is) return;
        vector<ll> a(N*N, -1);
        vector<ll> X(N*N, -1);
        for (int i = 0; i < N; ++i) {
            int x;
            is >> x; x--;
            X[x] = i+1;
        } // end i
        int l = 0;
        for (int i = 0; i < X.size(); ++i) {
            if(X[i] != -1) {
                int t = X[i]-1;
                int k = X[i];
                a[i] = k;
                while (t > 0) {
                    if(l >= i){ os << "No\n"; return; }
                    if (a[l] == -1) {
                        a[l] = k; t--;
                    }
                    l++;
                }
            }
        } // end i
        map<ll, ll> rem;
        for (int i = 0; i < a.size(); ++i) {
            if(X[i] != -1){
                if(X[i] != N) rem[X[i]] = N-X[i];
            }
            else if(a[i] == -1){
                if(rem.empty()){ os << "No\n"; return; }
                a[i] = rem.begin()->first;
                rem.begin()->second--;
                if(rem.begin()->second == 0) rem.erase(rem.begin());
            }
        } // end i

        os << "Yes\n";
        for (auto &&ai : a) {
            assert(ai != -1);
            os << ai << ' ' ;
        } // end ai
        os << endl;

    }
};

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef DEBUG
    string test_cases = "test_K-thK.txt";
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int loop = 0;
    while(fs) {
        loop++;
        cout << '#' << loop << "#------\n";
        solver(fs, cout).run();
    }
    if(loop <= 1) {
        cout << "===" << endl;
        while(cin) solver(cin, cout).run();
    }
#else
    solver(cin, cout).run();
#endif
    return 0;
}


Measured memory_bytes: 5120