#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7fffffff;
const double eps = 1e-10;
const double pi = acos(-1.0);
inline int read() {
  int x = 0, f = 1;
  char ch;
  ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch & 15);
    ch = getchar();
  }
  if (f)
    return x;
  else
    return -x;
}
const int N = 140582 + 10;
int n, S = -1;
long long c[N], a[N], b[N];
int main() {
  n = read();
  for (int i = 0; i < n; i++) scanf("%I64d", &b[i]);
  for (int i = 0; i < n; i++)
    if (b[i] > b[((i - 1 + n) % n)]) {
      S = i;
      break;
    }
  if (S == -1) {
    if (b[0] == 0) {
      printf("YES\n");
      for (int i = 1; i <= n; i++) printf("%d ", 1);
    } else
      printf("NO\n");
    return 0;
  }
  c[S] = 0;
  a[S] = b[S];
  for (int i = 1; i < n; i++) {
    int u = (S - i + n) % n;
    if (b[u] > b[((u - 1 + n) % n)]) {
      c[u] = 0;
      a[u] = b[u];
      continue;
    }
    c[u] = (b[((u - 1 + n) % n)] - b[u]) / a[((u + 1) % n)] + 1;
    a[u] = c[u] * a[((u + 1) % n)] + b[u];
  }
  printf("YES\n");
  for (int i = 0; i < n; i++) printf("%I64d ", a[i]);
  return 0;
}
