#include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int main() {
    int n;
    scanf("%d", &n);
    pii a[n - 1];
    rep(i, n - 1) scanf("%d", &a[i].fi), a[i].se = i;
    sort(a, a + (n - 1));
    priority_queue<pii> que;
    int cur = 0;
    int ans[n - 1];
    For(v, 2, n + 1) {
        while (cur < n - 1 && v - a[cur].fi >= 1) {
            que.push(a[cur]);
            ++cur;
        }
        if (que.empty()) {
            puts("NO");
            return 0;
        }
        auto [l, i] = que.top();
        que.pop();
        ans[i] = v - l;
    }
    puts("YES");
    rep(i, n - 1) printf("%d\n", ans[i]);
}