#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
  int n; cin >> n;
  vector<pair<ll, int>>  P(n);
  for(int i = 0; i < n; i++){
    int num; cin >> num;
    P[i].first = num;
    P[i].second = i;
  }
  sort(P.begin(), P.end());
  vector<int> ans(n-1);
  for(int i = 0; i < n-1; i++){
    if(P[i].first>i+1){
      cout << "No" << endl;
      return 0;
    }else{
      ans[P[i].second] = P[i].first;
    }
  }
  cout << "Yes" << endl;
  for(int i = 0; i < n-1; i++){
    cout << ans[i] << endl;
  }
  return 0;
}