#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

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