#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> a(n-1);
    vector<int> ans(n-1);
    for(int i = 0; i < n-1; i++) cin >> a[i];
    vector<P> vp;
    for(int i = 0; i < n-1; i++) vp.push_back(P(a[i], i));
    sort(vp.begin(), vp.end());
    for(int i = 0; i < n-1; i++){
        int a = vp[i].first;
        int idx = vp[i].second;
        if(a > i+1){
            cout << "NO" << endl;
            return 0;
        }
        ans[idx] = (i+2)-a;
    }
    cout << "YES" << endl;
    for(int x : ans) cout << x << endl;
}