1 //minamoto
 2 #include<iostream>
 3 #include<cstdio>
 4 using namespace std;
 5 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
 6 char buf[1<<21],*p1=buf,*p2=buf;
 7 int read(){
 8     int res,f=1;char ch;
 9     while((ch=getc())>'9'||ch<'0')(ch=='-')&&(f=-1);
10     for(res=ch-'0';(ch=getc())>='0'&&ch<='9';res=res*10+ch-'0');
11     return res;
12 }char sr[1<<21],z[20];int C=-1,Z=0;
13 inline void Ot(){fwrite(sr,1,C+1,stdout),C=-1;}
14 void print(int x){
15     if(C>1<<20)Ot();if(x<0)sr[++C]='-',x=-x;
16     while(z[++Z]=x%10+48,x/=10);
17     while(sr[++C]=z[Z],--Z);sr[++C]='\n';
18 }
19 const int N=65555;
20 int head[N<<2],Next[N<<2],ver[N<<2],tot,head1[N<<2],ver1[N<<2],Next1[N<<2],tot1,head2[N<<2],ver2[N<<2],Next2[N<<2],tot2;
21 inline void add(int u,int v){ver[++tot]=v,Next[tot]=head[u],head[u]=tot;}
22 inline void add1(int u,int v){ver1[++tot1]=v,Next1[tot1]=head1[u],head1[u]=tot1;}
23 inline void add2(int u,int v){ver2[++tot2]=v,Next2[tot2]=head2[u],head2[u]=tot2;}
24 int n,du[N],q[N],dep[N],fa[N][35],ans[N];
25 void topo(){
26     int h=1,t=0;
27     for(int i=1;i<=n;++i)if(!du[i])q[++t]=i;
28     while(h<=t){
29         int u=q[h++];
30         for(int i=head[u];i;i=Next[i]){
31             int v=ver[i];
32             if(--du[v]==0)q[++t]=v;
33         }
34     }
35 }
36 int LCA(int u,int v){
37     if(dep[u]<dep[v])swap(u,v);int k=dep[u]-dep[v];
38     for(int i=0;i<18;++i)
39     if((k>>i)&1)u=fa[u][i];
40     if(u==v)return u;
41     for(int i=17;i>=0;--i)
42     if(fa[u][i]!=fa[v][i])u=fa[u][i],v=fa[v][i];
43     return fa[u][0];
44 }
45 void dfs(int u){
46     for(int i=head2[u];i;i=Next2[i])
47     dfs(ver2[i]),ans[u]+=ans[ver2[i]];
48     ++ans[u];
49 }
50 int main(){
51 //    freopen("testdata.in","r",stdin);
52     n=read();
53     for(int i=1,u;i<=n;++i){
54         while(true){
55             if((u=read())==0)break;
56             ++du[i],add1(i,u),add(u,i);
57         }
58     }
59     topo();
60     for(int i=1;i<=n;++i){
61         int u=ver1[head1[q[i]]];
62         for(int j=head1[q[i]];j;j=Next1[j])u=LCA(u,ver1[j]);
63         add2(u,q[i]),dep[q[i]]=dep[u]+1,fa[q[i]][0]=u;
64         for(int j=1;j<18;++j)fa[q[i]][j]=fa[fa[q[i]][j-1]][j-1];
65     }
66     dfs(0);
67     for(int i=1;i<=n;++i)print(ans[i]-1);
68     return Ot(),0;
69 }