#include <bits/stdc++.h>
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
void bad(string mes = "Impossible") {
  cout << mes;
  exit(0);
}
void bad(int mes) {
  cout << mes;
  exit(0);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
template <typename T>
void amax(T& x, T y) {
  x = max(x, y);
}
template <typename T>
void amin(T& x, T y) {
  x = min(x, y);
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)2e5 + 12, base = 1e9 + 7;
const long long llinf = 2e18 + 5;
template <typename T>
T binpow(T n, T second) {
  if (second <= 0) return 1LL;
  if (second % 2 == 0) {
    T b = binpow(n, second / 2);
    return (1LL * b * b) % base;
  } else {
    return (1LL * binpow(n, second - 1) * n) % base;
  }
}
long long b[maxn], a[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  long long r = -1;
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    r = max(r, b[i]);
  }
  if (r == 0) {
    cout << "YES\n";
    for (int i = 0; i < n; i++) cout << 1 << ' ';
    return 0;
  }
  int pos = -1;
  for (int i = 0; i < n; i++) {
    if (b[i] == r && b[(i - 1 + n) % n] < b[i]) {
      pos = i;
      break;
    }
  }
  if (pos == -1) {
    cout << "NO";
    return 0;
  }
  a[pos] = b[pos];
  for (int i = pos - 1; i >= 0; i--) {
    if (i == pos - 1 && b[i] == 0) {
      a[i] = 2ll * a[(i + 1) % n];
    } else {
      a[i] = a[(i + 1) % n] + b[i];
    }
  }
  for (int i = n - 1; i > pos; i--) {
    if (i == (pos - 1 + n) % n && b[i] == 0) {
      a[i] = 2ll * a[(i + 1) % n];
    } else {
      a[i] = a[(i + 1) % n] + b[i];
    }
  }
  cout << "YES\n";
  for (int i = 0; i < n; i++) cout << a[i] << ' ';
  return 0;
}
