from collections import deque

N = int(input())
int1 = lambda x: int(x) - 1
T = [[] for _ in range(N)]
for _ in range(N - 1):
    a, b = map(int1, input().split())
    T[a].append(b)
    T[b].append(a)

# 根からの距離(dfs)
d = deque([0])
root_distance = [None] * N
root_distance[0] = 0
while d:
    v = d.pop()
    for x in T[v]:
        if root_distance[x] is None:
            root_distance[x] = root_distance[v] + 1
            d.append(x)
# print(root_distance)

# 葉からの距離(bfs)
leaves = {i for i in range(N) if len(T[i]) == 1}
leaf_distance = [0 if i in leaves else None for i in range(N)]
d = deque(leaves)
while d:
    v = d.popleft()
    for x in T[v]:
        if leaf_distance[x] is None:
            leaf_distance[x] = leaf_distance[v] + 1
            d.append(x)
# print(leaf_distance)

for i in range(N):
    print(min(root_distance[i], leaf_distance[i]))