from collections import deque

INF = float('inf')

N = int(input())

nodes = [[] for _ in range(N)]

for n in range(N-1):
    x,y = list(map(int, input().split(' ')))
    x -= 1
    y -= 1
    nodes[x].append(y)
    nodes[y].append(x)

# find leaves
leaves = []    
for i in range(N):
    if len(nodes[i]) == 1 and i != 0:
        leaves.append(i)

# find distance from the root
d1 = [INF] * N
q = deque()
q.append((0,-1))
d1[0] = 0
while 0 < len(q):
    m,n = q.popleft()
    for c in nodes[m]:
        if c != n and d1[c] == INF:
            d1[c] = min(d1[c], d1[m] + 1)
            q.append((c,m))
        
# find distance from the leaf
d2 = [INF] * N
q = deque()
for i in leaves:
    q.append((i,-1))
    d2[i] = 0
    
while 0 < len(q):
    m,n = q.popleft()
    for c in nodes[m]:
        if c != n and d2[c] == INF:
            d2[c] = min(d2[c], d2[m] + 1)
            q.append((c,m))

for i in range(N):
    print(min(d1[i], d2[i]))