#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<bitset>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ull unsigned long long
#define endl '\n'
#define clr(a, b) memset(a, b, sizeof(a))
#define lowbit(x) x & -x
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define PB push_back
#define POP pop_back
const double pi = acos(-1);
const int maxn = 1e5 + 10;
const int maxm = (maxn<<5) + 5;
const ll mod = 1e9 + 7;
const int hash_mod = 19260817;
int n, cnt, id;
vector<int> z[maxn<<1], f[maxn<<1], g[maxn<<1];
int num[maxn], du[maxn], top[maxn], h[maxn], fa[maxn][64];
void topsort(){
queue<int> que;
for(int i = 1 ; i <= n ; ++ i){
if(!du[i]) que.push(i);
}
while(!que.empty()){
int u = que.front();
que.pop();
top[++id] = u;
for(int i = 0 ; i < z[u].size() ; ++ i){
int v = z[u][i];
du[v] --;
if(!du[v]) que.push(v);
}
}
}
int lca(int x, int y){
if(h[x] < h[y]) swap(x, y);
int k = h[x] - h[y];
for(int i = 0 ; i < 32 ; ++ i){
if((k >> i) & 1) x = fa[x][i];
}
if(x == y) return x;
for(int i = 31 ; i >= 0 ; -- i){
if(fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
}
return fa[x][0];
}
void dfs(int u){
for(int i = 0 ; i < g[u].size() ; ++ i){
int v = g[u][i];
dfs(v);
num[u] += num[v] + 1;
}
}
int main()
{
scanf("%d", &n);
for(int i = 1 ; i <= n ; ++ i){
int x;
while(scanf("%d", &x) && x){
du[i] ++;
z[x].PB(i); f[i].PB(x);
}
}
topsort();
for(int i = 1 ; i <= n ; ++ i){
int u = top[i];
int x = (f[u].size() == 0 ? 0 : f[u][0]);
for(int j = 0 ; j < f[u].size() ; ++ j){
int v = f[u][j];
x = lca(x, v);
}
g[x].PB(u);
h[u] = h[x] + 1;
fa[u][0] = x;
for(int j = 1 ; j < 31 ; ++ j) fa[u][j] = fa[fa[u][j-1]][j-1];
}
dfs(0);
for(int i = 1 ; i <= n ; ++ i) cout << num[i] << endl;
return 0;
}