// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
    vector<int> a;
    vector<int> b;
    int s = 0, e = -1;
    for(int i = 0; i < n; i++){
        int y; cin >> y;
        a.push_back(y);
        if(i != 0 && i+y-1 >= e){
            e = i+y-1;
            s = i;
        }
        if(e < i){
            b.push_back(i);
        }else{
            b.push_back(b[i-s]);
        }
    }
    vector<vector<int>> g(n);
    for(int i = 0; i < n; i++){
        int y = a[i];
        if(i+y < n){
            g[b[i+y]].push_back(b[y]);
            g[b[y]].push_back(b[i+y]);
        }
    }
    vector<int> d(n , -1);
    for(int i = 0; i < n; i++){
        if(d[b[i]] != -1)continue;
        sort(g[b[i]].begin() , g[b[i]].end());
        d[b[i]] = 1;
        for(int x : g[b[i]]){
            if(d[b[i]] == d[x])d[b[i]]++;
        }
    }
    for(int i = 0; i < n; i++)cout << d[b[i]] << " ";
}