#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
inline void solve(), read();
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  read();
  solve();
  return 0;
}
long long n;
vector<long long> a, b;
inline void solve() {
  long long eq = 1;
  for (long long i = 1; i < n; i++) {
    eq &= b[i] == b[0];
  }
  if (eq) {
    if (b[0] != 0) {
      cout << "NO"
           << "\n";
      return;
    } else {
      cout << "YES"
           << "\n";
      for (long long i = 0; i < n; i++) {
        cout << 1 << " ";
      }
      return;
    }
  }
  b.push_back(b[0]);
  long long k = 0;
  for (long long i = 1; i <= n; i++) {
    if (b[i] > b[i - 1]) {
      k = i;
      break;
    }
  }
  a.resize(n + 1, 0);
  a[k] = b[k];
  for (long long i = k - 1; i >= 1; i--) {
    long long x = (b[i - 1] - b[i]) / a[i + 1] + 1;
    a[i] = a[i + 1] * x + b[i];
  }
  if (a[n]) {
    a[0] = a[n];
  }
  if (a[0]) {
    a[n] = a[0];
  }
  if (!a[0]) {
    long long x = (b[n - 1] - b[0]) / a[1] + 1;
    a[0] = a[1] * x + b[0];
    a[n] = a[0];
  }
  for (long long i = n - 1; i >= k + 1; i--) {
    long long x = (b[i - 1] - b[i]) / a[i + 1] + 1;
    a[i] = a[i + 1] * x + b[i];
  }
  for (long long i = 0; i < n; i++) {
    if (b[i] != a[i] % a[i + 1]) {
      cout << "NO"
           << "\n";
      return;
    }
  }
  cout << "YES"
       << "\n";
  for (long long i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << "\n";
}
inline void read() {
  cin >> n;
  b.resize(n);
  for (long long i = 0; i < n; i++) {
    cin >> b[i];
  }
}
