#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
int x[510];

const int MAX = 2000;
struct edge {
    int to, cap, rev;
};

vector<edge> G[MAX];
int level[MAX];
int iter[MAX];

void add_edge(int from, int to, int cap) {
    G[from].push_back((edge){to, cap, (int)G[to].size()});
    G[to].push_back((edge){from, 0, (int)G[from].size()-1});
}

void bfs(int s) {
    memset(level, -1, sizeof(level));
    queue<int> que;
    level[s] = 0;
    que.push(s);
    while (!que.empty()) {
        int v = que.front(); que.pop();
        for (int i = 0; i < G[v].size(); i++) {
            edge &e = G[v][i];
            if (e.cap > 0 and level[e.to] < 0) {
                level[e.to] = level[v] + 1;
                que.push(e.to);
            }
        }
    }
}
int dfs(int v, int t, int f) {
    if (v == t) return f;
    for (int &i = iter[v]; i < G[v].size(); i++) {
        edge &e = G[v][i];
        if (e.cap > 0 and level[v] < level[e.to]) {
            int d = dfs(e.to, t, min(f, e.cap));
            if (d > 0) {
                e.cap -= d;
                G[e.to][e.rev].cap += d;
                return d;
            }
        }
    }
    return 0;
}

int dinic(int s, int t) {
    int flow = 0;
    while (true) {
        bfs(s);
        if (level[t] < 0) return flow;
        memset(iter, 0, sizeof(iter));
        int f;
        while ((f = dfs(s, t, inf)) > 0) {
            flow += f;
        }
    }
}

void solve() {
    int a[n*n+1];
    memset(a, 0, sizeof(a));
    for (int i = 0; i < n; i++) a[x[i]] = i+1;

    int s = 1600, t = 1601;
    for (int i = 0; i < n; i++) {
        add_edge(s, 2*i, i);
        add_edge(s, 2*i+1, n-i-1);
    }
    
    int idx = 1;
    for (int i = 0; i <= n; i++) {
        int p = idx;
        while (idx <= n*n && a[idx] == 0) idx++;
        add_edge(2*n+i, t, idx-p);
        for (int j = 0; j < n; j++) {
            if (x[j] >= idx) {
                add_edge(2*j, 2*n+i, inf);
            } else {
                add_edge(2*j+1, 2*n+i, inf);
            }
        }
        idx++;
    }

    int f = dinic(s, t);
    //cerr << f << endl;
    if (f < n * n - n) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
        vector<int> res[501];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < G[2*i].size(); j++) {
                edge e = G[2*i][j];
                int v = e.to, c = G[e.to][e.rev].cap;
                for (int k = 0; k < c; k++)
                    res[v-2*n].push_back(i+1);
            }
            for (int j = 0; j < G[2*i+1].size(); j++) {
                edge e = G[2*i+1][j];
                int v = e.to, c = G[e.to][e.rev].cap;
                for (int k = 0; k < c; k++)
                    res[v-2*n].push_back(i+1);
            }
        }
        
        idx = 1;
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j < res[i].size(); j++) {
                cout << res[i][j] << " ";
                idx++;
            }
            if (i < n)
                cout << a[idx++] << " ";
        }
        cout << endl;
    }
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> x[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    solve();
}

Measured memory_bytes: 10620