#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
const double eps = 1e-12;
template <typename T>
inline void read(T &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') {
    f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  x *= f;
}
const int N = 150010;
int n;
long long b[N];
long long a[N];
inline int Minus(int x) {
  --x;
  if (!x) x = n;
  return x;
}
inline int Add(int x) {
  ++x;
  if (x == n + 1) x = 1;
  return x;
}
signed main() {
  read(n);
  for (int i = 1; i <= n; i++) read(b[i]);
  int pos = 1;
  for (int i = 2; i <= n; i++)
    if (b[pos] < b[i]) pos = i;
  for (int i = 1; i <= n; i++)
    if (b[i] == b[pos] && b[Minus(i)] != b[pos]) {
      pos = i;
      break;
    }
  a[pos] = b[pos];
  if (b[pos] == 0) {
    puts("YES");
    for (int i = 1; i <= n; i++) printf("1 ");
    return 0;
  }
  bool fl = 0;
  for (int i = Minus(pos); i != pos; i = Minus(i)) {
    if (b[i] >= a[Add(i)]) {
      puts("NO");
      return 0;
    }
    if (b[i] == 0 && !fl) {
      fl = 1;
      a[i] = a[Add(i)] * 100;
    } else
      a[i] = a[Add(i)] + b[i];
  }
  puts("YES");
  for (int i = 1; i <= n; i++) printf("%lld ", a[i]);
  return 0;
}
