#include <bits/stdc++.h>
using namespace std;
#define fo(v, a, b) for(int v = a; v <= b; v++)
#define fr(v, a, b) for(int v = a; v >= b; v--)
#define cl(a, v) memset(a, v, sizeof(a))

const int N = 55, M = 2510;

int n, m, a[N], b[N]; bool dp[N][N][M];

void solve(int l, int r, int x) {
    if(l == r) return ;
    int L = r - l, now = 0;
    while(true) {
        fo(p, l, r - 1) if(dp[l][p][x] && dp[p + 1][r][x]) {
            solve(l, p, x), solve(p + 1, r, x);
            fo(i, l, r - 1) a[i] += now;
            return ;
        }
        x += L, now++;
    }
}

int main()
{
    scanf("%d", &n); fo(i, 1, n) scanf("%d", &b[i]);

    m = 50 * (n - 1);
    fo(i, 1, n) {
        if(b[i] > m) puts("No"), exit(0);
        dp[i][i][b[i]] = true;
    }
    fo(len, 2, n) fo(l, 1, n - len + 1) {
        int r = l + len - 1, L = r - l;
        fo(p, l, r - 1) fo(i, 0, m)
            dp[l][r][i] |= (dp[l][p][i] && dp[p + 1][r][i]);
        fr(i, m, L) dp[l][r][i - L] |= dp[l][r][i];
    }

    if(!dp[1][n][0]) puts("No"), exit(0);
    puts("Yes"), solve(1, n, 0);
    fo(i, 1, n - 1) printf("%d ", a[i]);
    puts("");

    return 0;
}