#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define syy myson
using namespace std;
const int maxn=70000;
int n,z[maxn],in[maxn],anss,i,j;
vector<int>v[maxn];//表示能吃i的都有哪些 
void dfs(int x)
{
	in[x]=1;
	for(int ii=0;ii<v[x].size();ii++)dfs(v[x][ii]);
}
int Main()
{
	freopen("catas.in","r",stdin);freopen("catas.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		while(1)
		{
			int fuck;
			scanf("%d",&fuck);
			if(fuck!=0)v[fuck].push_back(i);
			else break;
		}
	}
	for(i=1;i<=n;i++)
	{
		memset(in,0,sizeof(in));
		dfs(i);
		for(j=1;j<=n;j++)
		  if((i!=j)&&in[j]&&((v[j].size()-1)==0))
		    z[i]++;
	}
	for(i=1;i<=n;i++)printf("%d\n",z[i]);
	return 0;
}
int main(){;}
int syy=Main();