#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;

int main() {
   InTheNameOfGod;

    int n;
    cin >> n;

    vector<int> v(n);
    for(int &i : v) cin >> i;

    vector<vector<int> > g(n+1);
    vector<int> be(n, 0), mo(n, -1);

    for(int i = 1; i < n; i++) {
        g[v[i]].push_back(i+v[i]);
    }

    priority_queue<pair<int, int> > q;
    for(int i = 0; i < n; i++) {
        q.push({-1, -i});
    }

    vector<set<int> > no(n);

    while(!q.empty()) {
        pair<int, int> cur = q.top();
        q.pop();

        int x = -cur.second, val = -cur.first;

        if(no[x].find(val) != no[x].end() || mo[x] != -1) continue;
        mo[x] = val;

        for(int sz : g[x]) {
            if(mo[sz] == -1) {
                no[sz].insert(val);
                q.push({-val-1, -sz});
            }
        }
    }

    for(int i : mo) cout << i << ' ';

    return 0;
}