#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    int N;
    cin >> N;
    vector<int> a(N - 1);
    for(int i = 0; i < N - 1; i++) cin >> a[i];
    vector<int> ind(N - 1);
    for(int i = 0; i < N - 1; i++) ind[i] = i;
    sort(ind.begin(), ind.end(), [&](int x, int y){
        return a[x] < a[y];
    });
    int now = 2;
    vector<int> ans(N - 1);
    for(int i = 0; i < N - 1; i++){
        int t = a[ind[i]];
        if(t > now - 1){
            cout << "NO" << endl;
            return 0;
        }
        ans[ind[i]] = now - t;
        now++;
    }
    cout << "YES" << endl;
    for(int i = 0; i < N - 1; i++){
        cout << ans[i] << endl;
    }
}