/* -*- coding: utf-8 -*-
 *
 * 1373.cc:  No.1373 Directed Operations - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef pair<int,int> pii;

/* global variables */

pii ais[MAX_N];
int ps[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  int m = n - 1;
  
  for (int i = 0; i < m; i++) {
    int ai;
    scanf("%d", &ai);
    ais[i] = pii(ai, i);
  }
  sort(ais, ais + m);

  for (int i = 0, v = 1; i < m; i++, v++) {
    int ai = ais[i].first, ei = ais[i].second;
    if (ai > v) { puts("NO"); return 0; }
    ps[ei] = v - ai;
  }

  puts("YES");
  for (int i = 0; i < m; i++) printf("%d\n", ps[i] + 1);
  return 0;
}