#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int main() {
    int n; cin >> n;
    pair<int, int> a[n-1];
    for (int i = 0; i < n-1; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a, a+n-1);
    vector<int> ans(n-1);
    for (int i = 0; i < n-1; i++) {
        if (i + 2 - a[i].first <= 0) { cout << "NO\n"; return 0; }
        else ans[a[i].second] = i + 2 - a[i].first;
    }
    cout << "YES\n";
    for (int x : ans) cout << x << endl;
}