#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;}
int gcd(int x, int y) {return y?gcd(y, x%y):x;}

int dp[90][90][90], cho[90][90][90];
int a[90], f[90];

void dfs(int l, int r, int k) {
	if(l==r+1) return;
	if(l==r) {
		a[l]+=f[l]-k;
		return;
	}
	int up=dp[l][r][k%(r-l+1)], p=cho[l][r][k%(r-l+1)];
	for(int i=l; i<=r; ++i) a[i]+=(up-k)/(r-l+1);
	dfs(l, p-1, up); dfs(p+1, r, up);
}

int main() {
	int n=read(), fl=0;
	for(int i=1; i<=n; ++i) f[i]=read();
	if(fl) return puts("No"), 0;
	memset(dp, -1, sizeof dp);
	for(int len=1; len<=n-1; ++len) {
		for(int l=1; l+len-1<=n-1; ++l) {
			int r=l+len-1;
			if(l==r) {
				if(f[l]==f[l+1]) dp[l][l][0]=f[l];
				//for(int i=0; i<r-l+1; ++i)
				//	printf("[%d, %d] dp[%d]=%d\n", l, r, i, dp[l][r][i]);
				continue;
			} 
			//p=l or r
			if(dp[l+1][r][f[l]%(r-l)]>=f[l]) {
				if(f[l]>dp[l][r][f[l]%(r-l+1)]) {
					dp[l][r][f[l]%(r-l+1)]=f[l];
					cho[l][r][f[l]%(r-l+1)]=l;
				}
			}
			if(dp[l][r-1][f[r+1]%(r-l)]>=f[r+1]) {
				if(f[r+1]>dp[l][r][f[r+1]%(r-l+1)]) {
					dp[l][r][f[r+1]%(r-l+1)]=f[r+1];
					cho[l][r][f[r+1]%(r-l+1)]=r;
				}
			}
			
			for(int p=l+1; p<r; ++p) {
				int u=p-l, v=r-p, d=gcd(u, v), lcm=u/d*v;
				for(int i=0; i<lcm; ++i) {
					int t1=dp[l][p-1][i%u], t2=dp[p+1][r][i%v];
					if(t1>=i&&t2>=i) {
						int b=min((t1-i)/lcm, (t2-i)/lcm);
						for(int t=b; t>=0&&t>b-(r-l+1); --t) {
							int val=t*lcm+i;
							if(val>dp[l][r][val%(r-l+1)]) {
								dp[l][r][val%(r-l+1)]=val;
								cho[l][r][val%(r-l+1)]=p;
							}
						}
					}
				}
			}
			//for(int i=0; i<r-l+1; ++i)
			//	printf("[%d, %d] dp[%d]=%d\n", l, r, i, dp[l][r][i]);
		}
	}
	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;
}