from collections import defaultdict


def solve():
    N = int(input())

    C = defaultdict(list)
    P = [0] * (N + 1)
    for i in range(N - 1):
        x, y = map(int, input().split())
        C[x].append(y)
        P[y] = x

    R = [0] * (N + 1)
    stack = [(1, 0)]
    while stack:
        v, r = stack.pop()
        R[v] = r
        if C[v]:
            for c in C[v]:
                stack.append((c, r+1))

    L = [float('inf')] * (N + 1)
    s = set()
    for i in range(N + 1):
        if not C[i]:
            L[i] = 0
            s.add(i)

    def upd(x, d):
        if L[x] > d:
            L[x] = d
            return True
        return False

    d = 1
    while s:
        ns = set()
        for i in s:
            if upd(P[i], d):
                ns.add(P[i])
            for j in C[i]:
                if upd(j, d):
                    ns.add(j)
        s = ns
        d += 1

    for i in range(1, N + 1):
        print(min(R[i], L[i]))


if __name__ == '__main__':
    solve()