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

#define space putchar(' ')
#define enter putchar('\n')
#define pb push_back
#define int long long
#define P 998244353
#define HP 1000000000000002097
#define N (int)5e5+5

int read(){ char ch=getchar();int x=0,f=1;while(ch>'9' || ch<'0'){if(ch=='-') f=-1;ch=getchar();}while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return x*f; }
void print(int x){ if(x<0) putchar('-'),x=-x;if(x>9)print(x/10);putchar(x%10+'0'); }

int n,ti,cnt;
int dfn[N],low[N],f[N],siz[N];
bool vis[N];
vector<int> e[N];
stack<int> s;
void tarjan(int u)
{
	dfn[u]=low[u]=++ti;
	s.push(u);vis[u]=1;
	for(auto v:e[u]){
		if(!dfn[v]){
			tarjan(v);
			low[u]=min(low[u],low[v]);
		}
		else if(vis[v]) low[u]=min(low[u],dfn[v]);
	}
	if(dfn[u]==low[u]){
		f[u]=++cnt;//f表示节点所属强连通饭量的编号
		while(s.top()!=u){
			vis[s.top()]=0;
			f[s.top()]=cnt;
			s.pop();
			siz[cnt]++;//siz表示每个强连通分量的大小
		}
		s.pop();vis[u]=0;
		siz[cnt]++;
	}
}
int dis[N],ans[N];
bool vv[N];
void dfs(int u,int fa)
{
	if(siz[f[u]]>1){
		ans[u]=siz[f[u]];
		return;
	}
	for(auto v:e[u]){
		if(v==fa) continue;
		if(!vv[v]) vv[v]=1,dfs(v,u);//vv是记搜
		dis[u]=dis[v]+1,ans[u]=ans[v];
	}
}
main()
{
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1,v;i<=n;i++){
		cin>>v;
		e[i].pb(v);
	}
	for(int i=1;i<=n;i++){
		if(!dfn[i]) tarjan(i);
	}
	for(int i=1;i<=n;i++){
		if(siz[f[i]]<=1 && e[i][0]!=i){
			dfs(i,0);
		}
		else ans[i]=siz[f[i]];
	}
	for(int i=1;i<=n;i++){
		cout<<ans[i]+dis[i]<<"\n";
	}
	return 0;
}