def dfs(i, d):
    R[i] = d
    for j in chil[i]:
        dfs(j, d + 1)

def up(i, d):
    L[i] = min(L[i], d)
    for j in par[i]:
        up(j, d + 1)

N = int(raw_input())
par, chil = [[] for i in xrange(N)], [[] for i in xrange(N)]

for loop in xrange(N - 1):
    x, y = map(int, raw_input().split())
    x -= 1
    y -= 1
    chil[x].append(y)
    par[y].append(x)

R, L = [0] * N, [1e9] * N
dfs(0, 0)
for i in xrange(N):
    if len(chil[i]) == 0:
        up(i, 0)

for i in xrange(N):
    print min(R[i], L[i])