#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
    long long x;
public:
    mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
    mint operator-() const {
        return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res *= a;
    }

    mint operator^(const ll& t)const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }

    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t >> 1);
        a *= a;
        if (t & 1) a *= *this;
        return a;
    }
    // for prime MOD
    mint inv() const {
        return pow(MOD - 2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res /= a;
    }

    friend ostream& operator<<(ostream& os, const mint& m) {
        os << m.x;
        return os;
    }
};

//////////////////////////

int main() {
    
    ll N;
    cin >> N;

    vector<pair<ll, ll>> x(N + 1);

    repn(i, N) {
        cin >> x[i].first;
        x[i].second = i;
    }

    sort(++x.begin(), x.end());

    vector<ll> ans(N* N + 1,-1);

    repn(i, N) {
        ans[x[i].first] = x[i].second;
    }

    bool b = 1;

    repn(i, N) {
        ll count = 1;
        ll j = 1;
        while(count<x[i].second&&j<x[i].first) {
            if (ans[j] == -1) {
                ans[j] = x[i].second;
                count++;

                //cout << j << x[i].second << endl;
            }
            j++;
        }

        if (count < x[i].second) { b = 0; }
    }

    for (ll i = N; i >= 1; i--) {
        ll count = 1;
        ll j = N * N;

        while (count <= N - x[i].second && j > x[i].first) {
            if (ans[j] == -1) {
                ans[j] = x[i].second;
                count++;

                //cout << j << x[i].second << endl;
            }
            j--;
        }

        if (count <= N - x[i].second) { b = 0; }
    }

    if (b == 0) { cout << "No"; }
    else {
        cout << "Yes"<<endl;
        repn(i, N* N) cout << ans[i] << " ";
    }

	system("PAUSE");
}

Measured memory_bytes: 3328