import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
from collections import deque

def bfs1():
    q = deque([0])
    dist = [-1]*N
    dist[0] = 0
    
    while q:
        v = q.popleft()
        
        for nv in adj_list[v]:
            if dist[nv]==-1:
                dist[nv] = dist[v]+1
                q.append(nv)
    
    return dist
    
def dfs(v, p):
    is_leaf = True
    res = 10**18
    
    for nv in adj_list[v]:
        if nv==p:
            continue
        
        is_leaf = False
        res  = min(res, dfs(nv, v)+1)
    
    if is_leaf:
        res = 0
    
    from_leaf[v] = res
    
    return res

def bfs2():
    q = deque([0])
    visited = [-1]*N
    visited[0] = 1
    
    while q:
        v = q.popleft()
        
        for nv in adj_list[v]:
            if visited[nv]==-1:
                visited[nv] = 1
                from_leaf[nv] = min(from_leaf[nv], from_leaf[v]+1)
                q.append(nv)

N = int(input())
adj_list = [[] for _ in range(N)]

for _ in range(N-1):
    xi, yi = map(int, input().split())
    adj_list[xi-1].append(yi-1)
    adj_list[yi-1].append(xi-1)

from_root = bfs1()
from_leaf = [-1]*N
dfs(0, -1)
bfs2()

for i in range(N):
    print(min(from_root[i], from_leaf[i]))