#include <bits/stdc++.h>
using namespace std;
const int maxn = 300010, inf = 0x7fffffff;
int n, a[maxn], L[maxn][20], R[maxn][20];
inline int read() {
  char ch = getchar();
  int x = 0;
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return x;
}
struct node {
  int minn[maxn << 2], maxx[maxn << 2];
  void pushup(int o) {
    minn[o] = min(minn[o * 2], minn[o * 2 + 1]);
    maxx[o] = max(maxx[o * 2], maxx[o * 2 + 1]);
  }
  void build(int o, int l, int r, int id) {
    if (l == r) {
      minn[o] = L[l][id];
      maxx[o] = R[l][id];
      return;
    }
    int mid = (l + r) >> 1;
    build(o * 2, l, mid, id);
    build(o * 2 + 1, mid + 1, r, id);
    pushup(o);
  }
  int query1(int o, int l, int r, int x, int y) {
    if (x <= l && r <= y) return minn[o];
    int mid = (l + r) >> 1, res = inf;
    if (x <= mid) res = min(res, query1(o * 2, l, mid, x, y));
    if (y > mid) res = min(res, query1(o * 2 + 1, mid + 1, r, x, y));
    return res;
  }
  int query2(int o, int l, int r, int x, int y) {
    if (x <= l && r <= y) return maxx[o];
    int mid = (l + r) >> 1, res = -inf;
    if (x <= mid) res = max(res, query2(o * 2, l, mid, x, y));
    if (y > mid) res = max(res, query2(o * 2 + 1, mid + 1, r, x, y));
    return res;
  }
} tree[20];
int main() {
  n = read();
  for (int i = 1; i <= n; i++) {
    a[i] = read();
    a[i + n] = a[i + 2 * n] = a[i];
  }
  for (int i = 1; i <= 3 * n; i++)
    L[i][0] = max(1, i - a[i]), R[i][0] = min(3 * n, i + a[i]);
  for (int j = 1; j <= 18; j++) {
    tree[j - 1].build(1, 1, 3 * n, j - 1);
    for (int i = 1; i <= 3 * n; i++) {
      L[i][j] = tree[j - 1].query1(1, 1, 3 * n, L[i][j - 1], R[i][j - 1]);
      R[i][j] = tree[j - 1].query2(1, 1, 3 * n, L[i][j - 1], R[i][j - 1]);
    }
  }
  tree[18].build(1, 1, 3 * n, 18);
  for (int i = n + 1; i <= n * 2; i++) {
    int ans = 0, l = i, r = i;
    for (int j = 18; j >= 0; j--) {
      int tl = tree[j].query1(1, 1, 3 * n, l, r),
          tr = tree[j].query2(1, 1, 3 * n, l, r);
      if (tr - tl + 1 < n) {
        ans += (1 << j);
        l = tl;
        r = tr;
      }
    }
    if (r - l + 1 < n) ans++;
    printf("%d ", ans);
  }
  return 0;
}
