#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pci = pair<char, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
const ll infll = 1e18 + 3;
const int maxn = 1e6 + 77;
const int nmax = 1e6 + 77;
const ll basell = 1e18 + 3;
const int mod = 1e9 + 7;
const ld eps = 1e-7;
const int inf = 1009000999;
const int nv = 100505;
const int baseint = 1000200013;
const ld PI = acos(-1.0);
inline bool EQ(ld a, ld b) { return fabs(a - b) < 1e-9; }
ll b[2 * nv];
int inline solve() {
  ios::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
  ;
  int n;
  cin >> n;
  ll m = 0;
  int e = 0;
  for (int i = 0; i < n; ++i) {
    cin >> b[i];
    if (m < b[i]) {
      m = b[i];
    }
    if (i > 0 && b[i] != b[i - 1]) e = 1;
  }
  if (b[0] != b[n - 1]) e = 1;
  if (!e) {
    if (m == 0) {
      cout << "YES\n";
      for (int i = 0; i < n; ++i) {
        cout << 1 << " \n";
      }
      return 0;
    }
    cout << "NO";
    return 0;
  }
  int s = 0;
  for (int i = 0; i < n; ++i) {
    if (b[i] == m && b[(i - 1 + n) % n] != m) {
      s = i;
      break;
    }
  }
  cout << "YES\n";
  for (int i = 1; i < n; ++i) {
    b[(s - i + n) % n] += b[(s - i + 1 + n) % n];
    if (i == 1) b[(s - i + n) % n] += m;
  }
  for (int i = 0; i < n; ++i) {
    cout << b[i] << " ";
  }
  return 0;
}
int32_t main() {
  solve();
  return 0;
}
