#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<set>
#include<random>
#include<chrono>
#include<bitset>
#include<map>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<string>
#define eb emplace_back

using namespace std;
const int maxn=(1<<18)+10, maxm=11+10, inf=2e9+10, P=1e9+7;
const double eps=1e-10, pi=acos(-1.0);
typedef long long LL;
typedef unsigned long long ULL;
const LL INF=4e18;
typedef pair<LL, int> pli;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, LL> pll;
inline int read() {
	int x=0, f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}
mt19937 rnd((unsigned)chrono::steady_clock::now().time_since_epoch().count());
inline int ksm(int x, int y) {
	int s=1;
	for(; y; y>>=1, x=1LL*x*x%P)
		if(y&1) s=1LL*s*x%P;
	return s;
}
inline int add(int x, int y) {x+=y; return x>=P?x-P:x;}
inline int del(int x, int y) {x-=y; return x<0?x+P:x;}
LL gcd(LL x, LL y) {return y?gcd(y, x%y):x;}

int dp[60][60][60];
pii cho[60][60][60];
int a[60], f[60];

void dfs(int l, int r, int k) {
	if(l==r+1) return;
	int p, c;
	tie(p, c)=cho[l][r][k];
	for(int i=l; i<=r; ++i) a[i]+=c;
	dfs(l, p-1, k+(r-l+1)*c); dfs(p+1, r, k+(r-l+1)*c);
}

int main() {
	int n=read(), fl=0;
	for(int i=1; i<=n; ++i) f[i]=read(), fl|=(f[i]>50);
	if(fl) return puts("No"), 0;
	for(int i=1; i<=n; ++i) dp[i][i-1][f[i]]=1;
	for(int len=1; len<=n-1; ++len) {
		for(int l=1; l+len-1<=n-1; ++l) {
			int r=l+len-1;
			for(int k=0; k<=50; ++k) {
				for(int p=l; p<=r; ++p) 
					for(int c=0; c<=50; ++c) {
						if(k+(r-l+1)*c<=50&&dp[l][p-1][k+(r-l+1)*c]&&dp[p+1][r][k+(r-l+1)*c]) {
							dp[l][r][k]=1;
							cho[l][r][k]=make_pair(p, c);
						} 
					}
			}
		}
	}
	if(dp[1][n-1][0]==0) return puts("No"), 0;
	puts("Yes");
	dfs(1, n-1, 0);
	for(int i=1; i<n; ++i) printf("%d ", a[i]);
	return 0;
}