import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

n = int(input())
G = [[] for _ in range(n)]
for _ in range(n - 1):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    G[a].append(b)
    G[b].append(a)

d = [-1] * n
d[0] = 0
topo = []
que = [0]
par = [-1] * n
while que:
    s = que.pop()
    topo.append(s)
    for t in G[s]:
        if t == par[s]:
            continue
        par[t] = s
        d[t] = d[s] + 1
        que.append(t)

inf = 10**18
dd = [inf] * n
topo.reverse()
for s in topo[:-1]:
    if dd[s] >= inf:
        dd[s] = 0
    p = par[s]
    dd[p] = min(dd[p], dd[s] + 1)

for a, b in zip(d, dd):
    print(min(a, b))