#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const double PI = acos(-1.);
const double eps = 1e-10;
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 1e6 + 5;
int b[MAXN];
long long a[MAXN];
int c[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  int pos = 1, maxn = 0, f = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &b[i]);
    c[i] = b[i];
    maxn = max(maxn, b[i]);
    if (b[i]) f = 1;
  }
  b[0] = b[n];
  for (int i = 1; i <= n; i++) {
    if (b[i] == maxn && b[i - 1] != b[i]) pos = i;
  }
  if (!f) {
    puts("YES");
    for (int i = 1; i <= n; i++) printf("%d ", 1);
    return 0;
  }
  a[pos] = b[pos];
  int t = pos == 1 ? n : pos - 1;
  if (!b[t]) c[t] = c[pos];
  for (int i = pos - 1; i >= 1; i--) a[i] = a[i % n + 1] + c[i];
  for (int i = n; i > pos; i--) a[i] = a[i % n + 1] + c[i];
  for (int i = 1; i <= n; i++) {
    if ((!a[i % n + 1]) || a[i] % a[i % n + 1] != b[i]) return 0 * puts("NO");
  }
  puts("YES");
  for (int i = 1; i <= n; i++) printf("%lld ", a[i]);
  return 0;
}
