import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

void main(){
    auto N = readInt();
    auto x = readInts();
    foreach(ref xi; x) {
        --xi;
    }
    auto a = new int[](N*N);
    auto b = new bool[](N*N);
    auto m = iota(1, N+1).array;
    int idx;
    zip(x, m).sort();
    foreach(i; iota(N)) {
        if(b[x[i]]) {
            writeln("No");
            return;
        }
        b[x[i]] = true;
        a[x[i]] = m[i];
        foreach(j; iota(m[i]-1)) {
            while(idx < x[i] && b[idx]) {
                ++idx;
            }
            if(idx >= x[i]) {
                writeln("No");
                return;
            }
            b[idx] = true;
            a[idx] = m[i];
        }
    }
    zip(x, m).sort!((a, b) => a > b);
    idx = N*N-1;
    foreach(i; iota(N)) {
        foreach(j; iota(N - m[i])) {
            while(idx > x[i] && b[idx]) {
                --idx;
            }
            if(idx <= x[i]) {
                writeln("No");
                return;
            }
            b[idx] = true;
            a[idx] = m[i];
        }
    }
    writeln("Yes");
    writeln(a.map!(to!string).join(" "));
}

