#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+9;
int n,a[N];
int b[N];
bool flag;
int stk[N];
int top;
struct info {
	int l,r;	
}A[N<<2];
int ans[N];
int cnt;
int xx;
int main(){
    scanf("%d",&n);
    for(int i=1; i<n; ++i) scanf("%d",&a[i]);
    for(int i=1; i<=n; ++i) {
		b[i]=a[i]-a[i-1];
    	if(b[i]!=2&&b[i]!=-2&&b[i]!=0)flag=true;
	}
	if(flag)puts("No");
	else {
		for(int i=1; i<=n; ++i) {
			if(b[i]==2)stk[++top]=i,stk[++top]=i;
			else if(b[i]==-2) {
				while(b[i]<0&&top) {
					A[++cnt]=(info)<%stk[top],i%>;
					--top;
					b[i]++;
				}
				if(b[i]!=0){flag=true;break;}
			}else if(b[i]==0) {
				if(top)A[++cnt]=(info)<%stk[top],i%>,top--;
				else {flag=true;break;}
				stk[++top]=i;
			}
		}
		if(flag) {puts("No");return 0;}
		for(int i=1; i<=cnt; ++i) {
			if(!ans[A[i].l])ans[A[i].l]=A[i].r;
			else if(!ans[A[i].r])ans[A[i].r]=A[i].l;
		}
		puts("Yes");
		for(int i=1; i<=n; ++i)printf("%d ",ans[i]);
	}
	
    return 0;
}