#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;

template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}

constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;

#define all(a) (a).begin(), (a).end()

int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n; cin>>n;
    vector<P> a;
    for(int i=0; i<n-1; i++){
        int b; cin>>b;
        a.emplace_back(b, i);
    }

    sort(all(a));

    bool valid = true;
    for(int i=0; i<n-1; i++){
        if(i + 1 < a[i].first) valid = false;
    }

    if(!valid){
        cout << "NO" << endl;
        return 0;
    }

    vector<int> ans(n-1);
    for(int i=0; i<n-1; i++){
        ans[a[i].second] = i + 1 - a[i].first + 1;
    }

    cout << "YES" << endl;
    for(int i=0; i<n-1; i++){
        cout << ans[i] << endl;
    }

    return 0;
}