#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n;
vector<int> g[200000];
queue<int> f;
int m[10010];
int h[10010];//记录入边数 
int main(){
	freopen("catas.in","r",stdin);
	freopen("catas.out","w",stdout);
cin>>n;
for(int q=1;q<=n;q++)
{
	int u=0;
	while(1)
	{
		
		int x;
		cin>>x;
		if(x==0) break;
		u++;
		g[x].push_back(q);
	}
	h[q]=u;
}
int ans=0;
for(int q=1;q<=n;q++)
{
	ans=0;
	memset(m,0,sizeof(m));
	f.push(q);
	while(f.size())
	{
		int d=f.front();f.pop();
		for(int w:g[d])
		{
			m[w]++;
			if(m[w]==h[w]) 
			{
				ans++;
				f.push(w);
			}
			
		}
	}
	cout<<ans<<endl;
}
return 0;
}