#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll inf=INF*INF;
const ll mod=998244353;
const ll MAX=140010;



signed main(){
    ll n;cin>>n;
    vector<pll>a(n-1);
    rep(i,n-1){
        cin>>a[i].fi;a[i].se=i;
    }
    vector<bool>dp(n);
    dp[0]=1;
    ll j=0;
    sort(all(a));
    REP(i,1,n){
        if(i-a[j].fi>=0){
            dp[i]=1;
            j++;
        }else{
            break;
        }
    }
    if(dp[n-1]){
        cout<<"YES"<<endl;
        vector<ll>ans(n);
        rep(i,n-1){
            ans[a[i].se]=i+2-a[i].fi;
        }
        rep(i,n-1){
            cout<<ans[i]<<endl;
        }
    }else{
        cout<<"NO"<<endl;
    }
}