#include <bits/stdc++.h>

using i64 = long long;

constexpr int inf = 1e9;

int exgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
}

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    int n;
    std::cin >> n;
    --n;

    std::vector<int> s(n + 1);
    for (int i = 0; i <= n; ++i) {
        std::cin >> s[i];
    }

    std::vector f(n, std::vector(n + 1, std::vector<int>{}));
    std::vector g(n, std::vector(n + 1, std::vector<std::tuple<int, int, int>>{}));
    for (int i = 0; i < n; ++i) {
        f[i][i + 1] = {s[i] == s[i + 1] ? s[i] : -inf};
        g[i][i + 1] = {{i, -1, -1}};
    }
    for (int len = 2; len <= n; ++len) {
        for (int l = 0; l + len <= n; ++l) {
            int r = l + len;
            f[l][r].assign(r - l, -inf);
            g[l][r].assign(r - l, {-1, -1, -1});
            for (int i = l; i < r; ++i) {
                auto add = [&](int v, int a, int b) {
                    int c = v % (r - l);
                    if (f[l][r][c] < v) {
                        f[l][r][c] = v;
                        g[l][r][c] = {i, a, b};
                    }
                };
                int p = i - l, q = r - (i + 1);
                if (!p) {
                    int v = s[l];
                    if (v <= f[i + 1][r][v % q]) {
                        add(v, -1, v % q);
                    }
                } else if (!q) {
                    int v = s[r];
                    if (v <= f[l][i][v % p]) {
                        add(v, v % p, -1);
                    }
                } else {
                    int x, y, gcd = exgcd(p, q, x, y), lcm = p / gcd * q;
                    for (int a = 0; a < p; ++a) {
                        for (int b = 0; b < q; ++b) {
                            if (f[l][i][a] == -inf || f[i + 1][r][b] == -inf || (a - b) % gcd) {
                                continue;
                            }
                            int t = ((a - b) / gcd * x % q * p + a) % lcm;
                            if (t < 0) {
                                t += lcm;
                            }
                            int mn = std::min(f[l][i][a], f[i + 1][r][b]);
                            if (t <= mn) {
                                t = (mn - t) / lcm * lcm + t;
                                for (int o = 0; o < r - l; ++o) {
                                    int x = t - o * lcm;
                                    if (x < 0) {
                                        break;
                                    }
                                    add(x, a, b);
                                }
                            }
                        }
                    }
                }
            }
        }
    }

    auto print = [&](auto self, int l, int r, int c, int x, int d) {
        if (l == r) {
            return;
        }
        auto [i, a, b] = g[l][r][c];
        int v = (f[l][r][c] - x) / (r - l) + d;
        // std::cerr << i << ": " << "f[" << l << "][" << r << "][" << c << "] : " << v << " " << f[l][r][c] << "\n";
        assert(f[l][r][c] >= x);
        self(self, l, i, a, f[l][r][c], v);
        std::cout << v << " ";
        self(self, i + 1, r, b, f[l][r][c], v);
    };
    for (int i = 0; i < n; ++i) {
        if (f[0][n][i] != -inf) {
            std::cout << "Yes\n";
            print(print, 0, n, i, 0, 0);
            return 0;
        }
    }

    std::cout << "No\n";

    return 0;
}