#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long a = 0;
  char c = getchar();
  bool f = 0;
  while (!isdigit(c)) {
    if (c == '-') f = 1;
    c = getchar();
  }
  while (isdigit(c)) {
    a = (a << 3) + (a << 1) + (c ^ '0');
    c = getchar();
  }
  return f ? -a : a;
}
deque<long long> q, ans;
signed main() {
  long long N = read(), a = read(), cnt = 0;
  bool f = 1;
  q.push_back(a);
  for (long long i = 2; i <= N; ++i) {
    long long t = read();
    f &= t == a;
    q.push_back(t);
  }
  if (f)
    if (a)
      puts("NO");
    else {
      puts("YES");
      for (long long i = 1; i <= N; ++i) printf("%d ", 1);
    }
  else {
    while (q[q.size() - 1] <= q[q.size() - 2]) {
      q.push_back(q.front());
      q.pop_front();
      ++cnt;
    }
    ans.push_back(q.back());
    q.pop_back();
    q.push_front(ans.back());
    while (q.size() != 1) {
      long long t = ans.back() + q.back();
      if (q.size() != 1 && q[q.size() - 2] >= t)
        t += (long long)ceil((q[q.size() - 2] - t + 1) * 1.0 / ans.back()) *
             ans.back();
      ans.push_back(t);
      q.pop_back();
    }
    reverse(ans.begin(), ans.end());
    while (cnt--) {
      ans.push_front(ans.back());
      ans.pop_back();
    }
    puts("YES");
    for (long long i = 1; i <= N; ++i) printf("%lld ", ans[i - 1]);
  }
  return 0;
}
