from collections import defaultdict

INF = 1 << 62
N = int(input())

adj = defaultdict(list)
for _ in range(N-1):
    U, V = map(lambda x: int(x)-1, input().split())
    adj[U].append(V)
    adj[V].append(U)


def dfs(v, par, dep):
    res = INF
    for to in adj[v]:
        if to == par: continue
        res = min(res, dfs(to, v, dep+1))

    if res == INF:
        res = 0

    ans[v] = min(dep, res)
    return res + 1


ans = [INF] * N
dfs(0, -1, 0)
print(*ans, sep='\n')