#include<bits/stdc++.h>
#define int long long
#define db double
#define maxn 1000005
#define mod 998244353
#define fir first
#define sec second
#define pr pair<int,int>
#define pb push_back
#define mk make_pair
#define inf 10000000000000000
using namespace std;
inline int read()
{
    int SS=0,WW=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
	{
        if(ch=='-')WW=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
	{
        SS=(SS<<1)+(SS<<3)+(ch^48);
        ch=getchar();
    }
    return SS*WW;
}
inline void write(int XX)
{
    if(XX<0)putchar('-'),XX=-XX;
    if(XX>9)write(XX/10);
    putchar(XX%10+'0');
}
int T,n,sum,a[maxn],f[15][15],b[maxn];
char s[maxn];
void dfs(int u)
{
	if(u>=n)
	{
		for(int i=1;i<n;i++)
		{
			for(int j=i;j<n;j++)
			{
				f[i][j]=inf;
				for(int k=i;k<=j;k++)f[i][j]=min(f[i][j],b[k]);
			}
		}
		for(int i=1;i<=n;i++)
		{
			sum=0;
			for(int j=1;j<i;j++)sum+=f[j][i-1];
			for(int j=i;j<n;j++)sum+=f[i][j];
			if(sum!=a[i])return;
		}
		puts("Yes");
		for(int i=1;i<n;i++)write(b[i]),putchar(' ');
		exit(0);
	}
	for(int i=0;i<=20;i++)b[u]=i,dfs(u+1);
}
signed main()
{
	n=read();
	for(int i=1;i<=n;i++)a[i]=read();
	dfs(1),puts("No");
    return 0;
}