def read_data():
    N = int(input())
    Es = [set() for n in range(N)]
    for n in range(N-1):
        x, y = map(int, input().split())
        x -= 1
        y -= 1
        Es[x].add(y)
        Es[y].add(x)
    return N, Es

def solve(N, Es):
    # 根と葉を始点とした幅優先探索で、距離の近いところから埋めていく。
    frontier = [0] + [v for v in range(1, N) if len(Es[v]) == 1]
    dist = [N] * N
    for pos in frontier:
        dist[pos] = 0
    d = 0
    while frontier:
        d += 1
        new_frontier = []
        for pos in frontier:
            for n_pos in Es[pos]:
                if dist[n_pos] > d:
                    dist[n_pos] = d
                    new_frontier.append(n_pos)
        frontier = new_frontier
    return dist

N, Es = read_data()
dist = solve(N, Es)
for d in dist:
    print(d)