// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
#else
#define debug(x...)
#define Debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    vector<vector<int>> inv(n);
    rep(i, 0, n) {
        int x; cin >> x; --x;
        a[i] = x, inv[x].push_back(i);
    }
    vector<int> vis(n, 0), comp(n, -1), ans(n, -1);
    rep(i, 0, n) {
        if (vis[i]) continue;
        vector<int> v;
        int x = i;
        for (; !~comp[x]; comp[x] = i, x = a[x]) v.push_back(x);
        int p = 0; for (; p < sz(v) && v[p] != x; ++p);
        v = vector<int>(v.begin() + p, v.end());
        debug(v)
        for (auto j: v) ans[j] = sz(v);
        function<void(int, int)> dfs = [&](int u, int d) {
            if (vis[u]) return;
            vis[u] = 1, ans[u] = d;
            for (auto j: inv[u]) if (!~ans[j]) dfs(j, d + 1);
        };
        for (auto j: v) dfs(j, sz(v));
    }
    rep(i, 0, n) cout << ans[i] << " \n"[i==n-1];

    return 0;
}