/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2021.02.05 21:50:48
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n;cin >> n;
    vector<pair<int,int>> a(n-1);
    for (int i = 0; i < n-1; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < n-1; i++) {
        if (i+2 <= a[i].first) {
            puts("NO");
            return 0;
        }
        a[i].first = i+2-a[i].first;
    }
    sort(a.begin(), a.end(), [](pair<int,int> a,pair<int,int> b) {
        if (a.second != b.second) {
            return a.second < b.second;
        }
        return a.first < b.first;
    });
    puts("YES");
    for (int i = 0; i < n-1; i++) {
        cout << a[i].first << endl;
    }
    return 0;
}