#include <bits/stdc++.h>
using namespace std;
#define debug(fmt, ...) \
  fprintf(stderr, "[%d] : " fmt "\n", __LINE__, ##__VA_ARGS__)
template <class _Tx, class _Ty>
inline void chkmin(_Tx& x, const _Ty& y) { if (y < x) x = y; }
template <class _Tx, class _Ty>
inline void chkmax(_Tx& x, const _Ty& y) { if (x < y) x = y; }
bool Mbe;
using ll = long long;
constexpr int N = 55;
int n, a[N], tmp[N], ans[N], f[N][N][N], pos[N][N][N];
ll div_c(ll n, ll d) {
  return n >= 0 ? (n + d - 1) / d : n / d;
}
ll div_f(ll n, ll d) {
  return n >= 0 ? n / d : (n - d + 1) / d;
}
int exgcd(int a, int b, int& x, int& y) {
  if (!b) return x = 1, y = 0, a;
  int d = exgcd(b, a % b, y, x);
  return y -= a / b * x, d;
}
void print(int l, int r, ll tot) {
  if (l > r) return;
  int vl = a[l - 1], vr = a[r];
  if (l == r) {
    ans[l] = vl - tot;
    return;
  }
  int k = r - l + 1;
  int p = pos[l][r][tot % k];
  if (p == l) {
    ans[p] = (vl - tot) / k;
    print(l + 1, r, tot + ans[p]);
    return;
  }
  if (p == r) {
    ans[p] = (vr - tot) / k;
    print(l, r - 1, tot + ans[p]);
    return;
  }
  ans[p] = (f[l][r][tot % k] - tot) / k;
  print(l, p - 1, tot + ans[p] * (r - p + 1));
  print(p + 1, r, tot + ans[p] * (p - l + 1));
}
bool Med;
int main() {
  // debug("Mem: %.4lfMB.", fabs(&Med - &Mbe) / 1048576);
  cin.tie(0)->sync_with_stdio(0);
  cin >> n, --n;
  for (int i = 0; i <= n; ++i) cin >> a[i];
  if (!n) return cout << (!a[0] ? "Yes" : "No") << '\n', 0;
  memset(f, -1, sizeof(f));
  for (int k = 1; k <= n; ++k) {
    for (int l = 1, r = k; r <= n; ++l, ++r) {
      int vl = a[l - 1], vr = a[r];
      if (k == 1) {
        if (vl == vr) f[l][r][0] = vl;
      } else {
        if (f[l + 1][r][vl % (k - 1)] >= vl) {
          if (f[l][r][vl % k] < vl) {
            f[l][r][vl % k] = vl;
            pos[l][r][vl % k] = l;
          }
        }
        if (f[l][r - 1][vr % (k - 1)] >= vr) {
          if (f[l][r][vr % k] < vr) {
            f[l][r][vr % k] = vr;
            pos[l][r][vr % k] = r;
          }
        }
        for (int p = l + 1; p < r; ++p) {
          fill(tmp, tmp + k, -1);
          int kl = p - l, kr = r - p;
          int cl, cr, d = exgcd(kl, kr, cl, cr);
          for (int bl = 0; bl < kl; ++bl) {
            if (f[l][p - 1][bl] == -1) continue;
            int dpl = f[l][p - 1][bl];
            for (int br = 0; br < kr; ++br) {
              if (f[p + 1][r][br] == -1) continue;
              int dpr = f[p + 1][r][br];
              if ((dpl - dpr) % d != 0) continue;
              ll xl = (ll)(dpl - dpr) / d * cl;
              ll xr = (ll)(dpr - dpl) / d * cr;
              assert(dpl - kl * xl == dpr - kr * xr);
              ll num = min(div_f(xl, kr / d), div_f(xr, kl / d));
              xl -= num * (kr / d), xr -= num * (kl / d);
              assert(xl >= 0 && xr >= 0);
              assert(dpl - kl * xl == dpr - kr * xr);
              ll val = dpl - kl * xl;
              if (val >= 0) chkmax(tmp[val % k], val);
            }
          }
          int step = kl * kr, gd = __gcd(step, k);
          for (int i = 0; i < gd; ++i) {
            for (int j = 0, t = i; j < k / gd * 2; ++j, t = (t + step) % k) {
              int nt = (t + step) % k;
              if (tmp[nt] != -1) chkmax(tmp[t], tmp[nt] - step);
            }
          }
          for (int i = 0; i < k; ++i) {
            if (f[l][r][i] < tmp[i]) {
              f[l][r][i] = tmp[i], pos[l][r][i] = p;
            }
          }
        }
      }
    }
  }
  if (f[1][n][0] == -1) return cout << "No\n", 0;
  cout << "Yes\n";
  print(1, n, 0);
  for (int i = 1; i <= n; ++i) cout << ans[i] << " \n"[i == n];
  return 0;
}
/*
g++ -std=c++14 -O2 -o QOJ8225 QOJ8225.cpp
-Wall -Wextra -Wshadow
-fsanitize=address,undefined -g
*/