#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  int n;
  cin >> n;
  vector<pair<int, int>> ai(n-1);
  rep(i, n-1){
    int in;
    cin >> in;
    ai.at(i) = {in, i};
  }
  sort(ALL(ai));
  vector<int> ans(n-1);
  rep(i, n-1){
    auto [a, idx] = ai.at(i);
    if(i+1 < a){
      cout << "NO" << endl;
      return 0;
    }
    ans.at(idx) = i + 1 - a;
  }
  cout << "YES" << endl;
  for(auto i : ans){
    cout << i+1 << endl;
  }
  return 0;
}