#include <bits/stdc++.h>
using namespace std;
inline int readChar();
template <class T = int>
inline T readInt();
template <class T>
inline void writeInt(T x, char end = 0);
inline void writeChar(int x);
inline void writeWord(const char *s);
static const int buf_size = 4096;
inline int getChar() {
  static char buf[buf_size];
  static int len = 0, pos = 0;
  if (pos == len) pos = 0, len = fread(buf, 1, buf_size, stdin);
  if (pos == len) return -1;
  return buf[pos++];
}
inline int readChar() {
  int c = getChar();
  while (c <= 32) c = getChar();
  return c;
}
template <class T>
inline T readInt() {
  int s = 1, c = readChar();
  T x = 0;
  if (c == '-') s = -1, c = getChar();
  while ('0' <= c && c <= '9') x = x * 10 + c - '0', c = getChar();
  return s == 1 ? x : -x;
}
static int write_pos = 0;
static char write_buf[buf_size];
inline void writeChar(int x) {
  if (write_pos == buf_size)
    fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
  write_buf[write_pos++] = x;
}
template <class T>
inline void writeInt(T x, char end) {
  if (x < 0) writeChar('-'), x = -x;
  char s[24];
  int n = 0;
  while (x || !n) s[n++] = '0' + x % 10, x /= 10;
  while (n--) writeChar(s[n]);
  if (end) writeChar(end);
}
inline void writeWord(const char *s) {
  while (*s) writeChar(*s++);
}
struct Flusher {
  ~Flusher() {
    if (write_pos) fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
  }
} flusher;
inline void readWord(char *s) {
  int c = readChar();
  while (c > 32) *s++ = c, c = getChar();
  *s = 0;
}
inline void writeDouble(double x, int output_len) {
  if (x < 0) writeChar('-'), x = -x;
  int t = (int)x;
  writeInt(t), x -= t;
  writeChar('.');
  for (int i = output_len - 1; i > 0; i--) {
    x *= 10;
    t = min(9, (int)x);
    writeChar('0' + t), x -= t;
  }
  x *= 10;
  t = min(9, (int)(x + 0.5));
  writeChar('0' + t);
}
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using ull = unsigned long long;
using pnt = complex<ld>;
istream &operator>>(istream &in, pnt &p) {
  ld a, b;
  in >> a >> b;
  p = {a, b};
  return in;
}
ld crs(pnt a, pnt b) { return a.real() * b.imag() - a.imag() * b.real(); }
const int M = 998244353;
const int mod = 1e9 + 7;
const int inf = 1e9 + 100;
const ll inf64 = 1e18L;
const ld pi = acos(-1.0L);
const ld eps = 1e-5L;
const int di[] = {1, 1, -1, -1, 2, 2, -2, -2};
const int dj[] = {2, -2, 2, -2, 1, -1, 1, -1};
const int dii[] = {0, 1, -1, 0};
const int djj[] = {1, 0, 0, -1};
const int dx[] = {1, 1, -1, -1};
const int dy[] = {1, -1, 1, -1};
const int SQ = 1000;
const int nax = 3e5 + 1;
const int LG = 19;
int n;
pii t[LG][2 * nax];
inline pii comb(pii a, pii b) {
  return make_pair(min(a.first, b.first), max(a.second, b.second));
}
inline pii get(int l, int r, int i) {
  pii ret = make_pair(inf, -inf);
  for (l += 3 * n, r += 3 * n; l <= r; l = (l + 1) >> 1, r = (r - 1) >> 1) {
    if (l & 1) ret = comb(ret, t[i][l]);
    if (!(r & 1)) ret = comb(ret, t[i][r]);
  }
  return ret;
}
int pw[LG + 1];
int la[nax], ra[nax];
pii up[LG][nax];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cout.precision(10);
  cout << fixed;
  pw[0] = 1;
  for (int i = 1; i < LG + 1; i++) pw[i] = 2 * pw[i - 1];
  n = readInt();
  if (n == 1) return writeInt(0), 0;
  for (int i = 0; i < n; i++) {
    int x = readInt();
    la[i] = max(0, i - x);
    la[i + n] = i + n - x;
    la[i + 2 * n] = i + 2 * n - x;
    ra[i] = i + x;
    ra[i + n] = i + n + x;
    ra[i + 2 * n] = min(3 * n - 1, i + 2 * n + x);
  }
  for (int i = 0; i < 3 * n; i++) t[0][i + 3 * n] = make_pair(la[i], ra[i]);
  for (int i = 3 * n - 1; i; i--) t[0][i] = comb(t[0][i * 2], t[0][2 * i + 1]);
  for (int i = 0; i < 3 * n; i++) up[0][i] = make_pair(la[i], ra[i]);
  for (int j = 1; j < LG; j++) {
    for (int i = 0; i < 3 * n; i++) {
      up[j][i] = get(up[j - 1][i].first, up[j - 1][i].second, j - 1);
      t[j][i + 3 * n] = up[j][i];
    }
    for (int i = 3 * n - 1; i; i--)
      t[j][i] = comb(t[j][i * 2], t[j][i * 2 + 1]);
  }
  for (int i = 0; i < n; i++) {
    int ans = 0;
    int L = i + n, R = i + n;
    for (int i = LG - 1; i >= 0; i--) {
      pii q = get(L, R, i);
      if (q.second - q.first + 1 >= n) continue;
      L = q.first;
      R = q.second;
      ans += pw[i];
    }
    writeInt(ans + 1, ' ');
  }
}
