#include <bits/stdc++.h>
using namespace std;
int a[100005],n,b[100005]; 
int dfs(int w,int s){
	if(b[a[w]]) return s;
	b[a[w]]=1;
	return dfs(a[w],s+1);
}
int main() {
	cin>>n;
	for(int i=1;i<=n;++i) cin>>a[i];
	for(int i=1;i<=n;++i){
		memset(b,0,sizeof b);
		b[i]=1;
		cout<<dfs(i,1)<<endl;
	}
	//cout<<ans<<endl;
	return 0;
}