#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int SQRTN = 320;
const int LOGN = 20;
const double PI = acos(-1);
const double Tau = 2 * acos(-1);
unsigned long long n, b[N], a[N], s;
unsigned long long x = -1;
bool vis[N];
int main() {
  cin >> n;
  for (unsigned long long i = 0; i < n; i++) scanf("%lld", b + i), s += b[i];
  if (!s) {
    cout << "YES\n";
    for (unsigned long long i = 0; i < n; i++) cout << "1 ";
    return 0;
  }
  for (unsigned long long i = 0; i < n; i++)
    if (b[i] < b[((i + 1)) % n]) x = (i + 1) % n;
  if (x == -1) return puts("NO"), 0;
  int cur = (x - 1 + n) % n, nxt = (x);
  a[x] = b[x];
  vis[x] = 1;
  puts("YES");
  do {
    if (nxt == x) a[cur] = 2000000000;
    a[cur] += a[nxt] + b[cur];
    if (a[cur] % a[nxt] != b[cur]) {
      a[cur] -= a[cur] % a[nxt];
      a[cur] += b[cur];
    }
    vis[cur] = 1;
    nxt = cur;
    cur--;
    if (cur < 0) cur += n;
  } while (!vis[cur]);
  for (int i = 0; i < n; i++) cout << a[i] << " ";
  return 0;
}
