#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int a[n-1] = {};
    rep(i,n-1) cin >> a[i];
    vector<P> v(n-1);
    rep(i,n-1){   
        v[i].first = a[i];
        v[i].second = i;
    }
    sort(v.begin(), v.end());
    int ans[n-1] = {};

    rep(i,n-1){
        if(v[i].first > i+1){
            cout << "NO" << endl;
            return 0;
        }
        ans[v[i].second] = i + 2 - v[i].first;
    }

    cout << "YES" << endl;
    rep(i,n-1) cout << ans[i] << endl;
    return 0;
}