1

#include <bits/stdc++.h>
#define up(i,l,r) for(register int i = (l); i <= (r); i++)
#define dn(i,l,r) for(register int i = (l); i >= (r); i--)
#define ll long long
using namespace std;
template <typename T>void in(T &x){
    x = 0; T f = 1; char ch = getchar();
    while(!isdigit(ch)) {if(ch == '-') f = -1; ch = getchar();}
    while( isdigit(ch)) {x = 10 * x + ch - 48; ch = getchar();}
    x *= f;
}
template <typename T>void put(T x){
    //if(x < 0) x = -x,putchar('-');
    if(x > 9) put(x/10);
    putchar(x%10 + 48);
}
const int N = 100005;
int n;

struct edge{
    int v,nxt;
}e[N]; int tot,head[N];

void add(int u,int v){ e[++tot] = (edge){v,head[u]}; head[u] = tot;}

int dfn[N],low[N],sn,cnt,size[N],belong[N],f[N],maxn[N];
bool instack[N],vis[N];

stack<int>s;

void debug(){
    int t;
    while(!s.empty()){
        t = s.top(); put(t); putchar(' ');
        s.pop();
    }
}

void tarjan(int u){
    
    dfn[u] = low[u] = ++sn;
    s.push(u);
    instack[u] = 1;
    //if(u == 3) debug();
    for(int i = head[u]; i; i = e[i].nxt){
        int v = e[i].v;
        if(!dfn[v]){
            tarjan(v);
            low[u] = min(low[u],low[v]);
        }
        else if(instack[v]) low[u] = min(low[u],dfn[v]);
    }
    int t = -1;
    if(low[u] == dfn[u]){
        ++cnt;
        while(t != u){
            t = s.top();
            s.pop();
            instack[t] = 0;
            belong[t] = cnt; 
            ++size[cnt];
        }
    }
}

void dfs(int u){
    if(f[belong[u]]) return;
    f[belong[u]] = size[belong[u]];
    for(int i = head[u]; i; i = e[i].nxt){
        int v = e[i].v;
        //if(vis[belong[v]]) continue;
        if(belong[u] == belong[v]) continue;
        dfs(v); //vis[belong[v]] = 1;
        f[belong[u]] += f[belong[v]];
    }
}

int main(){
    int v;
    in(n);
    up(i,1,n){
        in(v);
        add(i,v);
    }
    up(i,1,n) if(!dfn[i]) tarjan(i);
    up(i,1,n) if(!vis[i]) dfs(i);
    up(i,1,n){
        put(f[belong[i]]); 
        putchar('
');
    }
    return 0;
}