#include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N;
pair<int,int> A[100000];
int ans[100000];

int main(){
  scanf("%d",&N);
  rep(i,N-1){ int a; scanf("%d",&a); A[i]={a,i}; }
  sort(A,A+N-1);
  rep(i,N-1) if(A[i].first>i+1){ printf("NO\n"); return 0; }
  rep(i,N-1) ans[A[i].second]=i+2-A[i].first;
  printf("YES\n");
  rep(i,N-1){ if(i) printf(" "); printf("%d",ans[i]); } printf("\n");
  return 0;
}