#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque

# %%
N = int(readline())
m = map(int, read().split())
XY = zip(m, m)

# %%
G = [[] for _ in range(N + 1)]
for x, y in XY:
    G[x].append(y)
    G[y].append(x)

# %%
leaf = [i for i, x in enumerate(G) if len(x) == 1]


# %%
def dist_from_root():
    INF = 10 ** 6
    dist = [INF] * (N + 1)
    dist[1] = 0
    q = deque([1])
    while q:
        v = q.popleft()
        for w in G[v]:
            if dist[w] == INF:
                dist[w] = dist[v] + 1
                q.append(w)
    return dist


# %%
def dist_from_leaf():
    INF = 10 ** 6
    dist = [INF] * (N + 1)
    q = deque(leaf)
    for v in leaf:
        dist[v] = 0
    while q:
        v = q.popleft()
        for w in G[v]:
            if dist[w] == INF:
                dist[w] = dist[v] + 1
                q.append(w)
    return dist


# %%
d1, d2 = dist_from_root(), dist_from_leaf()
d = (min(x, y) for x, y in zip(d1[1:], d2[1:]))
print('\n'.join(map(str, d)))