#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,mmx,avx,tune=native")
using namespace std;
const int MOD = 1000000007;
const int UNDEF = -1;
const int INF = 1 << 30;
template <typename T>
inline bool chkmax(T& aa, T bb) {
  return aa < bb ? aa = bb, true : false;
}
template <typename T>
inline bool chkmin(T& aa, T bb) {
  return aa > bb ? aa = bb, true : false;
}
int rint();
char rch();
long long rlong();
auto start = std::chrono::high_resolution_clock::now().time_since_epoch();
const int mn = 140582 + 1;
long long a[mn], b[mn];
int n;
int prev(int i) { return (i == 0) ? (n - 1) : (i - 1); }
int nxt(int i) { return (i == n - 1) ? 0 : (i + 1); }
void fail() {
  printf("NO\n");
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  n = rint();
  for (int i = 0; i < n; i++) {
    b[i] = rint();
  }
  bool allz = true;
  for (int i = 0; i < n; i++)
    if (b[i] != 0) allz = false;
  if (allz) {
    printf("YES\n");
    for (int i = 0; i < n; i++) printf("%d ", 1);
    exit(0);
  }
  long long hi = LLONG_MIN;
  for (int i = 0; i < n; i++) chkmax(hi, b[i]);
  int init = -1;
  for (int i = 0; i < n; i++) {
    if (b[i] == hi && b[prev(i)] != hi) init = i;
  }
  if (init == -1) fail();
  int x = init;
  a[x] = b[x];
  x = prev(x);
  for (int t = 1; t < n; t++) {
    long long need = max(a[prev(x)], a[init] + 1);
    long long needc = (need - b[x]) / a[nxt(x)];
    a[x] = b[x] + a[nxt(x)] * needc;
    if (a[x] < need) a[x] += a[nxt(x)];
    x = prev(x);
  }
  for (int i = 0; i < n; i++)
    if (a[i] % a[nxt(i)] != b[i]) fail();
  printf("YES\n");
  for (int i = 0; i < n; i++) printf("%lld ", a[i]);
}
static char stdinBuffer[1024];
static char* stdinDataEnd = stdinBuffer + sizeof(stdinBuffer);
static const char* stdinPos = stdinDataEnd;
void readAhead(size_t amount) {
  size_t remaining = stdinDataEnd - stdinPos;
  if (remaining < amount) {
    memmove(stdinBuffer, stdinPos, remaining);
    size_t sz = fread(stdinBuffer + remaining, 1,
                      sizeof(stdinBuffer) - remaining, stdin);
    stdinPos = stdinBuffer;
    stdinDataEnd = stdinBuffer + remaining + sz;
    if (stdinDataEnd != stdinBuffer + sizeof(stdinBuffer)) *stdinDataEnd = 0;
  }
}
int rint() {
  readAhead(16);
  int x = 0;
  bool neg = false;
  while (*stdinPos == ' ' || *stdinPos == '\n') ++stdinPos;
  if (*stdinPos == '-') {
    ++stdinPos;
    neg = true;
  }
  while (*stdinPos >= '0' && *stdinPos <= '9') {
    x *= 10;
    x += *stdinPos - '0';
    ++stdinPos;
  }
  return neg ? -x : x;
}
char rch() {
  readAhead(16);
  while (*stdinPos == ' ' || *stdinPos == '\n') ++stdinPos;
  char ans = *stdinPos;
  ++stdinPos;
  return ans;
}
long long rlong() {
  readAhead(32);
  long long x = 0;
  bool neg = false;
  while (*stdinPos == ' ' || *stdinPos == '\n') ++stdinPos;
  if (*stdinPos == '-') {
    ++stdinPos;
    neg = true;
  }
  while (*stdinPos >= '0' && *stdinPos <= '9') {
    x *= 10;
    x += *stdinPos - '0';
    ++stdinPos;
  }
  return neg ? -x : x;
}
