#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll HIGHINF = (ll)1e18;
const ll LOWINF = (ll)1e15;
const long double PI = 3.1415926535897932384626433;

template<typename T> vector<T> make_v(size_t N,T init){return vector<T>(N,init);}
template<typename... T> auto make_v(size_t N,T... t){return vector<decltype(make_v(t...))>(N,make_v(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int N; cin >> N;
	V<int> x(N+2,0),a(N*N+2,0),cntl(N*N+2,0),cntr(N*N+2,0);
	for(int i = 1; i <= N; ++i) cin >> x[i];
	for(int i = 1; i <= N; ++i){
		a[x[i]] = i;
		cntl[x[i]-1] += i-1;
		cntr[x[i]+1] += N-i;
	}
	// corner(cntl[0],"No");
	// corner(cntr[N*N+1],"No");
	// for(int i = 1; i <= N*N; ++i){
	// 	cntl[i] += cntl[i-1];
	// 	corner(cntl[i]>i,"No");
	// }
	// for(int i = 1; i <= N*N; ++i){
	// 	cntr[N*N-i+1] += cntr[N*N-i+2];
	// 	corner(cntr[i]>i,"No");
	// }

	V<P<int,int>> ord(N);
	for(int i = 0; i < N; ++i) ord[i] = {x[i+1],i+1};
	sort(ALL(ord));
	int idx = 1;
	for(int i = 0; i < N; ++i){
		int val = ord[i].second;
		int cnt = 1;
		while(idx<=N*N&&cnt<val){
			corner(a[idx]==val,"No");
			if(!a[idx]){
				cnt++;
				a[idx] = val;
			}
			idx++;
		}
	}
	idx = N*N;
	for(int i = N-1; 0 <= i; --i){
		int val = ord[i].second;
		int cnt = 0;
		while(1<=idx&&cnt<N-val){
			corner(a[idx]==val,"No");
			if(!a[idx]){
				cnt++;
				a[idx] = val;
			}
			idx--;
		}
	}
	cout << "Yes" << endl;
	cout << a[1];
	for(int i = 2; i <= N*N; ++i) cout << " " << a[i];
	cout << endl;

	return 0;
}


Measured memory_bytes: 4096