#include <iostream>
#include <cstring> 
#include <map>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <set>
// #include <bits/stdc++.h>

// #define int long long
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
#define Grf(it,u,to) for(int it=he[u],to;(to=e[it],it);it=nxt[it]) 
#define In __inline 
#define OP operator
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
namespace Mine {
	// mt19937_64 wql(514);
	In int read() {
		ll x=1,a=0;
		char ch=getchar();
		while(ch>'9' || ch<'0') x=(ch=='-')?-1:x,ch=getchar();
		while(ch>='0' && ch<='9') a=(a<<1)+(a<<3)+(ch-'0'),ch=getchar();
		return a*x;
	} const int N=90;
	int f[N],n,ans[N],d[N][N],g[N];
	bool check() {
		bool ret=1;
		For(i,1,n-1) d[i][i]=ans[i];//,printf("%d ",ans[i]);
		// puts("");
		For(x,1,n-1) For(y,x+1,n) d[x][y]=min(d[x][y-1],ans[y]);
		// For(i,1,n-1) {For(j,1,n-1) printf("%d ",d[i][j]); puts("");}
		// puts("");
		For(i,1,n) { g[i]=0;
			For(j,1,i-1) g[i]+=d[j][i-1];
			For(j,i,n-1) g[i]+=d[i][j];
		} For(i,1,n) ret&=(g[i]==f[i]);//,printf("%d ",g[i]);;
		// puts("");puts("");
		return ret;
	} 
	namespace S0 {
		bool dfs(int dep) {
			if(dep>=n) {
				return check();
			} For(i,0,20) {
				ans[dep]=i;
				if(dfs(dep+1)) return 1;
			} return 0;
		}
		void solve0() {
			dfs(1); puts("Yes");
			For(i,1,n-1) printf("%d ",ans[i]);
		}
	}
	signed main() {
		n=read(); For(i,1,n) f[i]=read();
		if(n<=5) S0::solve0();
		return 0;
	}
}signed main() {
	// freopen("homework.in","r",stdin);
	// freopen("homework.out","w",stdout);
	return Mine::main();
}