#include <bits/stdc++.h>
using namespace std;
int n;
vector<long long> b;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  b.resize(n);
  for (int i = 0; i < n; ++i) cin >> b[i];
  long long mi = *min_element(b.begin(), b.end());
  long long ma = *max_element(b.begin(), b.end());
  if (mi == ma) {
    if (mi == 0) {
      cout << "YES\n";
      for (int i = 0; i < n; ++i) cout << "1 ";
    } else
      cout << "NO";
    return 0;
  }
  cout << "YES\n";
  b.push_back(b[0]);
  int i = 1;
  while (!(b[i] == ma && b[i - 1] < ma)) ++i;
  i %= n;
  for (int j = 0; j < n - 1; ++j) {
    int ii = (i + n - 1) % n;
    b[ii] += (j ? b[i] : 2 * b[i]);
    i = ii;
  }
  for (int i = 0; i < n; ++i) cout << b[i] << " ";
  return 0;
}
