#include <bits/stdc++.h>
using namespace std;
const int N = 150000;
long long b[N], a[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  int sh = -1;
  long long maxx = *max_element(a, a + n);
  if (maxx == 0) {
    cout << "YES" << endl;
    for (int i = 0; i < n; i++) cout << 1 << " ";
    return 0;
  }
  if (a[0] == maxx && a[n - 1] < a[0]) {
    rotate(a, a + 1, a + n);
    sh = 1;
  } else {
    for (int i = 0; i < n; i++) {
      if (a[i + 1] == maxx && a[i] < a[i + 1]) {
        if (i + 1 != n - 1) {
          rotate(a, a + i + 1 + 1, a + n);
        }
        sh = i + 1 + 1;
        break;
      }
    }
    if (sh == -1) {
      cout << "NO" << endl;
      return 0;
    }
  }
  b[n - 1] = a[n - 1];
  b[n - 2] = 2 * a[n - 1] + a[n - 2];
  for (int i = n - 3; i >= 0; i--) b[i] = a[i] + b[i + 1];
  int x = n - sh;
  if (x == n) x = 0;
  rotate(b, b + x, b + n);
  cout << "YES" << endl;
  for (int i = 0; i < n; i++) cout << b[i] << " ";
  return 0;
}
