#include <bits/stdc++.h>

using i64 = long long;

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];
    }

    const int m = 50;

    std::vector f(n + 1, std::vector(n + 1, std::vector<int>(m * n + 1)));
    for (int i = 0; i <= n; ++i) {
        if (s[i] > m * n) {
            std::cout << "No\n";
            return 0;
        }
        f[i][i][s[i]] = true;
    }
    for (int len = 1; len <= n; ++len) {
        for (int l = 0; l + len <= n; ++l) {
            int r = l + len;
            for (int i = l; i < r; ++i) {
                for (int x = 0; x <= m; ++x) {
                    int a = (r - l) * x;
                    for (int y = 0; y + a <= m * n; ++y) {
                        f[l][r][y] |= f[l][i][y + a] && f[i + 1][r][y + a];
                    }
                }
            }
        }
    }

    if (!f[0][n][0]) {
        std::cout << "No\n";
        return 0;
    }

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

    auto print = [&](auto self, int l, int r, int y, int d) {
        if (l == r) {
            return;
        }
        for (int i = l; i < r; ++i) {
            for (int x = 0; x <= m; ++x) {
                int a = (r - l) * x;
                if (y + a <= m * n && f[l][i][y + a] && f[i + 1][r][y + a]) {
                    self(self, l, i, y + a, d + x);
                    std::cout << d + x << " ";
                    self(self, i + 1, r, y + a, d + x);
                    return;
                }
            }
        }
    };
    print(print, 0, n, 0, 0);

    return 0;
}