#include<bits/stdc++.h>
constexpr int maxn = 50 + 5, maxm = maxn * maxn;
int n, m;
int a[maxn], b[maxn];
bool f[maxn][maxn][maxm];
void dfs(int l, int r, int val) {
   if (l == r) return ;
   for (int c = 0; ; c++, val += r - l) {
      for (int p = l; p < r; p++) {
         if (f[l][p][val] && f[p + 1][r][val]) {
            dfs(l, p, val), dfs(p + 1, r, val);
            b[l] += c, b[r] -= c;
            return ;
         }
      }
   }
}
int main() {
   scanf("%d", &n), m = (n - 1) * 50;
   for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      if (a[i] > m) {
         return puts("No"), 0;
      }
      f[i][i][a[i]] = 1;
   }
   for (int len = 2; len <= n; len++) {
      for (int l = 1, r = len; r <= n; l++, r++) {
         for (int p = l; p < r; p++) {
            for (int val = 1; val <= m; val++) {
               f[l][r][val] |= f[l][p][val] & f[p + 1][r][val];
            }
         }
         for (int val = m; ~ val; val--) {
            f[l][r][val] |= f[l][r][val + len - 1];
         }
      }
   }
   if (! f[1][n][0]) {
      return puts("No"), 0;
   }
   puts("Yes");
   dfs(1, n, 0);
   for (int i = 1; i < n; i++) {
      printf("%d ", b[i] += b[i - 1]);
   }
   return 0;
}