n = int(input())
graph = [[] for _ in range(n)]
for _ in range(n-1):
    x, y = map(int, input().split())
    x -= 1
    y -= 1
    graph[x].append(y)
    graph[y].append(x)
parent = [0]*n
R = [0]*n
L = [n]*n
nodes = [0]
for i in nodes:
    for j in graph[i]:
        if j == parent[i]:
            continue
        parent[j] = i
        R[j] = R[i]+1
        if len(graph[j]) == 1:
            L[j] = 0
            while L[parent[j]] > L[j]+1:
                L[parent[j]] = L[j]+1
                j = parent[j]
        else:
            nodes.append(j)
for i in map(min, R, L):
    print(i)