#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long inf = 1000000000000000000;
double pi = 2 * acos(0);
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
long long lmax(long long a, long long b) {
  if (a < b)
    return b;
  else
    return a;
}
long long lmin(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long Pow(long long n, long long k) {
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
int main() {
  int n;
  scanf("%d", &n);
  long long b[n];
  long long ma = 0;
  long long mi = inf;
  for (long long i = 0; i < n; i++) {
    scanf("%lld", &b[i]);
    ma = max(ma, b[i]);
    mi = min(mi, b[i]);
  }
  if (ma == 0) {
    printf("YES\n");
    for (long long i = 0; i < n; i++) printf("1 ");
    printf("\n");
    return 0;
  }
  if (mi == ma) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  long long num = -1;
  for (long long i = 0; i < n; i++) {
    if (b[i] != ma) {
      num = i;
      break;
    }
  }
  long long now = num;
  for (;;) {
    now++;
    if (now == n) now = 0;
    if (b[now] == ma) {
      num = now;
      break;
    }
  }
  now = num;
  long long a[n];
  a[now] = b[now];
  long long c = 0;
  for (;;) {
    long long u = a[now];
    now--;
    if (now == -1) now = n - 1;
    if (now == num) break;
    a[now] = u + b[now];
    if (c == 0 && b[now] == 0) {
      c = 1;
      a[now] *= 2;
    }
  }
  for (long long i = 0; i < n; i++) printf("%lld ", a[i]);
  printf("\n");
}
