#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int n;
int f[maxn];
int p[85][85][85];
void exgcd(int a, int b, int &x, int &y){
    if(b == 0){
        x = 1; y = 0; return ;
    }
    exgcd(b, a % b, y, x); y -= a / b * x; return ;
}
int tp[6405]; int tc[85];
int tk[85];
pair<int, int> pc[85][85][85];
bool vis[85][85];
bool vs[85];
void dfs(int l, int r){
    // cerr << l << " " << r << endl;
    if(vis[l][r]) return ;
    vis[l][r] = 1;
    if(l == r){
        if(f[l] == f[l + 1]) p[l][r][0] = f[l];
        return ;
    }
    int N = r - l + 1;
    // cerr << l << " " << r << endl;
    for(int i = l;i <= r;i++){
        if(i == l){
            dfs(i + 1, r);
            if(p[i + 1][r][f[l] % (N - 1)] < f[l]) continue;
            p[l][r][f[l] % N] = max(p[l][r][f[l] % N], f[l]); continue;
        }
        if(i == r){
            dfs(l, i - 1);
            if(p[l][i - 1][f[r + 1] % (N - 1)] < f[r + 1]) continue;
            p[l][r][f[r + 1] % N] = max(p[l][r][f[r + 1] % N], f[r + 1]); continue;
        }
        dfs(l, i - 1); dfs(i + 1, r);
        int L = i - l; int R = r - i;
        int pg = __gcd(L, R); int pN = L * R / pg;
        int tx = 0, ty = 0; exgcd(L, R, tx, ty); int pR = R / pg;
        tx = (tx % pR + pR) % pR;
        for(int j = 0;j < pN;j++) tp[j] = -1;
        for(int j = 0;j < L;j++){
            if(p[l][i - 1][j] < 0) continue;
            for(int k = 0;k < R;k++){
                if(p[i + 1][r][k] < 0) continue;
                if(j % pg != k % pg) continue;
                int px = 1ll * ((k - j) / pg) * tx % pR; px = (px + pR) % pR; 
                int pmi = min(p[l][i - 1][j], p[i + 1][r][k]);
                int pnum = L * px + j;
                if(pnum > pmi) continue;
                // cerr << L << " " << j << " " << R << " " << k << " " << pnum << " " << tx << " " << ty << endl;
                assert(pnum % L == j && pnum % R == k);
                tp[pnum] = max(tp[pnum], pnum + (pmi - pnum) / pN * pN);
            }
        }
        for(int j = 0;j < N;j++) tc[j] = -1;
        for(int j = 0;j < pN;j++){
            if(tp[j] == -1) continue;
            tc[tp[j] % N] = max(tc[tp[j] % N], tp[j]);
        }
        for(int j = 0;j < N;j++){
            vs[j] = 0;
            // if(tc[j] >= 0) assert(tc[j] % N == j);
        }
        int x = (N - pN % N) % N;
        for(int j = 0;j < N;j++){
            if(vs[j]) continue;
            int now = j;
            do{
                if(tc[now] - pN > tc[(now + x) % N]){
                    tc[(now + x) % N] = tc[now] - pN;
                }
                vs[now] = 1; now = (now + x) % N;
                // cerr << now << endl;
            }while(now != j);
            do{
                if(tc[now] - pN > tc[(now + x) % N]){
                    tc[(now + x) % N] = tc[now] - pN;
                }
                now = (now + x) % N;
                // cerr << now << endl;
            }while(now != j);
        }
        for(int j = 0;j < N;j++){
            if(tc[j] > p[l][r][j]){
                p[l][r][j] = tc[j]; pc[l][r][j] = make_pair(tc[j], i);
            }
        }
    }
    // cerr << l << " " << r << endl << "? ";
    // for(int i = 0;i < N;i++){
        // cerr << p[l][r][i] << " ";
    // }
    // cerr << endl;
    // cerr << "? " << l << " " << r << " ok" << endl;
    return ;
}
int ans[maxn];
void dfsp(int l, int r, int num, int res){
    if(l == r){
        ans[l] = f[l] - num + res; return ;
    }
    int N = r - l + 1;
    // cerr << "? " << l << " " << r << " " << num << " " << res << endl;
    assert(p[l][r][num % N] >= num);
    if(f[l] % N == num % N && p[l + 1][r][f[l] % (N - 1)] >= f[l]){
        ans[l] = (f[l] - num) / N + res; dfsp(l + 1, r, f[l], ans[l]); return ;
    }
    if(f[r + 1] % N == num % N && p[l][r - 1][f[r + 1] % (N - 1)] >= f[r + 1]){
        ans[r] = (f[r + 1] - num) / N + res; dfsp(l, r - 1, f[r + 1], ans[r]); return ;
    }
    int pos = pc[l][r][num % N].second;
    // cerr << pc[l][r][num % N].first << " " << pc[l][r][num % N].second << endl;
    ans[pos] = (pc[l][r][num % N].first - num) / N + res;
    dfsp(l, pos - 1, pc[l][r][num % N].first, ans[pos]);
    dfsp(pos + 1, r, pc[l][r][num % N].first, ans[pos]);
    return ;
}   
int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> f[i];
    }
    if(n == 1){
        if(f[1] > 0){
            cout << "No" << endl; return 0;
        }
        cout << "Yes" << endl;
        cout << endl; return 0;
    }
    memset(p, -1, sizeof(p));
    dfs(1, n - 1);
    if(p[1][n - 1][0] < 0){
        cout << "No" << endl; return 0;
    }
    dfsp(1, n - 1, 0, 0);
    cout << "Yes" << '\n';
    for(int i = 1;i < n;i++){
        cout << ans[i] << " ";
    }
    cout << '\n';
    cout.flush(); return 0;
}