from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N = int(input())
e = [[] for _ in range(N)]
for _ in range(N-1):
    x,y = map(int,input().split())
    x -= 1
    y -= 1
    e[x].append(y)
    e[y].append(x)

v = deque()
R = [-1]*N
L = [-1]*N
R[0]=0
v.append(0)
while v:
    
    x = v.popleft()
    for ix in e[x]:
        
        if R[ix]!=-1:
            continue
        R[ix] = R[x] + 1
        v.append(ix)
        
for i in range(1,N):
    if len(e[i])==1:
        L[i]=0
        v.append(i)
while v:
    
    x = v.popleft()
    for ix in e[x]:
        
        if L[ix]!=-1:
            continue
        L[ix] = L[x] + 1
        v.append(ix)
for i in range(N):
    print(min(R[i],L[i]))