from collections import deque
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

n = int(input())
G = [[] for _ in range(n)]
for _ in range(n - 1):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    G[a].append(b)
    G[b].append(a)

d = [-1] * n
d[0] = 0
que = [0]

dd = [-1] * n
queque = deque()
while que:
    s = que.pop()
    leaf = True
    for t in G[s]:
        if d[t] != -1:
            continue
        leaf = False
        d[t] = d[s] + 1
        que.append(t)
    if leaf:
        dd[s] = 0
        queque.append(s)

while queque:
    s = queque.popleft()
    for t in G[s]:
        if dd[t] != -1:
            continue
        dd[t] = dd[s] + 1
        queque.append(t)

for a, b in zip(d, dd):
    print(min(a, b))