#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9 + 9;
const long long INF1 = 1e18 + 9;
const long long MAXN = 1e6 + 7;
const long long MAXN1 = 1 << 13;
const long long MAXN2 = 2e7 + 9;
const long long MOD = 1e9 + 7;
const long long MOD1 = 1e9 + 9;
const long long ALPH = 50;
const long long PW1 = 157;
const long long PW2 = 199;
const long long PW3 = 193;
const long long PW4 = 117;
const long double EPS = 1e-9;
const long long BLOCK = 387;
void solve();
signed main() {
  srand('a' + 'l' + 'e' + 'x' + 'X' + '5' + '1' + '2');
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
void solve() {
  int n;
  cin >> n;
  vector<long long> v;
  long long mx = -1, ind = -1, cnt = 0;
  for (int i = 0; i < n; ++i) {
    long long a;
    cin >> a;
    v.emplace_back(a);
    if (a == 0) ++cnt;
  }
  for (int i = 1; i <= n; ++i) {
    if (v[i - 1] < v[i % n]) {
      if (mx < v[i % n]) {
        mx = v[i % n];
        ind = i % n;
      }
    }
  }
  if (mx == -1 && v[0] == 0) {
    cout << "YES\n";
    for (int i = 0; i < n; ++i) {
      cout << "1 ";
    }
    return;
  }
  if (mx == -1) {
    cout << "NO";
    return;
  }
  vector<long long> ans(n);
  ans[ind] = mx;
  bool b = 1;
  for (int i = 1; i < n; ++i) {
    ans[(ind - i + n) % n] = ans[(ind - i + 1 + n) % n] + v[(ind - i + n) % n];
    if (v[(ind + n - i) % n] == 0 && b) {
      ans[(ind - i + n) % n] *= 2;
      b = 0;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; ++i) {
    cout << ans[i] << " ";
  }
}
