#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

vector<int> solve(vector<int>& x) {
	const int n = sz(x);
	vector<int> ans(n * n, -1);
	vector<Pii> vp;
	FOR(i, n) {
		ans[x[i]] = i;
		vp.emplace_back(x[i], i);
	}
	sort(vp.begin(), vp.end());
	{
		int cur = 0;
		for (auto kv : vp) {
			int rem = kv.second;
			while (cur < sz(ans) && rem > 0) {
				int& c = ans[cur];
				cur++;
				if (c != -1) continue;
				c = kv.second;
				rem--;
			}
		}
	}
	reverse(vp.begin(), vp.end());
	{
		int cur = n * n - 1;
		for (auto kv : vp) {
			int rem = n - 1 - kv.second;
			while (cur >= 0 && rem > 0) {
				int& c = ans[cur];
				cur--;
				if (c != -1) continue;
				c = kv.second;
				rem--;
			}
		}
	}

	return ans;
}

vector<int> to_indexes(const vector<int>& ans, int n) {
	vector<int> cnf;
	{
		vector<vector<int>> v(n);
		FOR(i, n * n) {
			assert(ans[i] != -1);
			v[ans[i]].push_back(i);
		}
		FOR(i, n) cnf.push_back(v[i][i]);
	}
	return cnf;
}

void test() {
	int n = 5;
	vector<int> hoge;
	FOR(i, n*n) hoge.push_back(i / n);
	random_shuffle(hoge.begin(), hoge.end());

	auto cnf = to_indexes(hoge, n);
	auto hoge2 = solve(cnf);
	auto cnf2 = to_indexes(hoge2, n);

	writerArr(hoge);
	writerArr(cnf);
	writerArr(hoge2);
	writerArr(cnf2);

	if (cnf != cnf2) {
		cout << "?";
	}
}

int main() {

	//while (true) {
	//	test();
	//}

	int n;
	reader(n);

	vector<int> x(n);
	FOR(i, n) reader(x[i]);
	FOR(i, n) x[i]--;

	auto ans = solve(x);
	auto cnf = to_indexes(ans, n);

	bool ok = true;
	FOR(i, n) if (cnf[i] != x[i]) ok = false;
	if (!ok) {
		puts("No");
		return 0;
	}

	for (auto& x : ans) x++;
	puts("Yes");
	writerArr(ans);

	return 0;
}

Measured memory_bytes: 3200