#include <bits/stdc++.h>
using namespace std;
long long int a[200009], b[200009];
int main() {
  int i, j, t1, t2, t3, t4, n;
  long long int buf1, buf2, buf3;
  bool rekt = true;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%lld", &b[i]);
  }
  t1 = t2 = 0;
  for (i = 0; i < n; i++) {
    if (!b[i]) {
      t1++;
    } else {
      if (b[i] != b[(i + 1) % n]) {
        rekt = false;
      }
    }
  }
  if (t1 == n) {
    printf("YES\n");
    for (i = 0; i < n; i++) {
      printf("1 ");
    }
    printf("\n");
    return 0;
  } else if (rekt) {
    printf("NO\n");
    return 0;
  }
  for (i = 0; i < n; i++) {
    if (b[i] < b[(i + 1) % n]) {
      t1 = (i + 1) % n;
      break;
    }
  }
  a[t1] = b[t1];
  t4 = n - 1;
  while (t4 > 0) {
    t1 = (t1 - 1 + 2 * n) % n;
    t2 = (t1 - 1 + 2 * n) % n;
    t3 = (t1 + 1) % n;
    buf1 = b[t2] - b[t1];
    buf1 /= a[t3];
    buf1 = max(buf1 + 1, 0ll);
    a[t1] = buf1 * a[t3] + b[t1];
    if (a[t1] == 0) {
      a[t1] = (buf1 + 1) * a[t3] + b[t1];
    }
    t4--;
  }
  printf("YES\n");
  for (i = 0; i < n; i++) {
    printf("%lld ", a[i]);
  }
  printf("\n");
  return 0;
}
