import sys
sys.setrecursionlimit(1000000)
def dfs(r,b,h,d):
	RL[h] = d
	if len(e[h]) == 1 and h != r:
		dfs(h,h,h,0)
	else:
		for nxt in e[h]:
			if nxt != b and d+1 < RL[nxt]:
				dfs(r,h,nxt,d+1)
N = input()
e = [[] for i in range(N)]
leaf = set([0])
RL = [N]*N
for i in range(N-1):
	x,y = map(int,raw_input().split())
	e[x-1].append(y-1)
	e[y-1].append(x-1)
dfs(0,0,0,0)
for i in range(N):
	print RL[i]