n = int(input())
g = [[] for _ in range(n)]
for i in range(n-1):
    a,b = [int(i) for i in input().split()]
    g[a-1].append(b-1)
    g[b-1].append(a-1)
 
order = []
st = [0]
parent = [-1]*n
L = [0]*n
while st:
    v = st.pop()
    order.append(v)
    for c in g[v]:
        if c != parent[v]:
            st.append(c)
            parent[c] = v
            L[c] = L[v]+1

from collections import deque
q = deque()
R = [-1]*n
for i in range(1,n):
    if len(g[i]) == 1:
        q.append(i)
        R[i] = 0
while q:
    v = q.popleft()
    for c in g[v]:
        if R[c] == -1:
            R[c] = R[v]+1
            q.append(c)

print(*(min(li,ri) for li,ri in zip(L,R)),sep="\n")