#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using u64=unsigned long long;
using LF=long double;
#define F(i,l,r) for(int i=l;i<=r;++i)
#define G(i,r,l) for(int i=r;i>=l;--i)
#define CT const&
#define IL inline
#define PB push_back
template<class T>
IL void tomn(T &x,T CT y){y<x?x=y,0:0;}
template<class T>
IL void tomx(T &x,T CT y){y>x?x=y,0:0;}
#define DEBUG(x) cerr<<"line:"<<__LINE__<<" "#x"="<<x<<endl
#define CUT cerr<<"**********\n"
const LF EPS=1e-10L;
IL int dcmp(LF x){return fabs(x)<=EPS?0:(x<0?-1:1);}
const LL INF=4e18L;

const int N=85;
int n,g[N];
namespace S1{
	const int N=15;
	LF a[N][N],x[N];
	bool calc(){
		int row=1;
		F(i,1,n-1){
			int p=-1;
			F(j,row,n)if(dcmp(a[j][i]))p=j;
			if(p==-1)continue;
			F(j,i,n)swap(a[row][j],a[p][j]);
			F(j,row+1,n){
				LF x=a[j][i]/a[row][i];
				F(k,i,n)a[j][k]-=x*a[row][k];
			}++row;
		}F(i,1,n-1)x[i]=0;
		F(i,row,n)if(dcmp(a[i][n]))return 0;
		G(i,row-1,1){
			int p=1;
			while(p<=n&&!dcmp(a[i][p]))++p;
			if(p>n)continue;
			x[p]=a[i][n]/a[i][p];
			F(j,1,i-1)a[j][n]-=a[j][p]*x[p],a[j][p]=0;
		}return 1;
	}
	bool main(){
		int f[N]{},p[N]{};
		F(i,1,n-1)p[i]=i;
		do{
			
			vector<int> vec{p+1,p+n};
			if(vec==vector<int>{3,1,4,2,5,6}){
				cerr<<"!!!\n";
			}
			
			F(i,0,N-1)F(j,0,N-1)a[i][j]=0;
			F(i,1,n){
				int mn;
				mn=n+1;G(j,i-1,1)tomn(mn,p[j]),a[i][mn]+=1;
				mn=n+1;F(j,i,n-1)tomn(mn,p[j]),a[i][mn]+=1;
				G(j,n-1,2)a[i][j-1]+=a[i][j];
				a[i][n]=g[i];
			}if(calc()){
				F(i,2,n-1)x[i]+=x[i-1];
				F(i,2,n-1)if(dcmp(x[i]-x[i-1])<0)goto ED;
				F(i,1,n-1)if(dcmp(x[i]-LL(x[i]+.5L)))goto ED;
				F(i,1,n-1)f[i]=x[p[i]]+.5L;
				F(i,1,n-1)if(f[i]<0)goto ED;
				goto OK;
			}ED:;
		}while(next_permutation(p+1,p+n));
		return 0;
	OK:
		puts("Yes");
		F(i,1,n-1)printf("%d ",f[i]);
		return 1;
	}
}
namespace S2{
	const int N=55,W=55;
	using D=bitset<N*W+100>;
	D f[N][N];
	int ans[N];
	void dfs(int l,int r,int i){
		if(l==r)return;
		F(m,l,r-1)F(x,0,W){
			if(i+x*(r-l)>n*W)break;
			if(f[l][m][i+x*(r-l)]&&f[m+1][r][i+x*(r-l)]){
				F(j,l,r-1)ans[j]+=x;
				return dfs(l,m,i+x*(r-l)),dfs(m+1,r,i+x*(r-l));
			}
		}
	}
	bool main(){
		G(l,n,1)F(r,l,n){
			f[l][r]=D{};
			if(l==r){
				f[l][r][g[l]]=1;
				
//				cerr<<l<<" "<<r<<" ";
//				F(i,0,10)cerr<<f[l][r][i];
//				cerr<<endl;
				
				continue;
			}
			F(m,l,r-1){
				D d=f[l][m]&f[m+1][r];
				G(i,n*W,0){
					if(!d[i])continue;
					int j=i;
					while(j>=0&&!f[l][r][j])
						f[l][r][j]=1,j-=(r-l);
				}
			}
			
//			cerr<<l<<" "<<r<<" ";
//			F(i,0,10)cerr<<f[l][r][i];
//			cerr<<endl;
				
		}if(!f[1][n][0])return 0;
		dfs(1,n,0),puts("Yes");
		F(i,1,n-1)printf("%d ",ans[i]);
		return 1;
	}
}
int main(){
#ifdef LOCAL
	freopen("B.in","r",stdin);
//	freopen(".out","w",stdout);
#endif
	scanf("%d",&n);
	F(i,1,n)scanf("%d",g+i);
	if(!S2::main())
		puts("No");
}