import sys
sys.setrecursionlimit(1000000)
def dfs(r,b,h,d):
	if RL[h] > d:
		RL[h] = d
		if len(e[h]) == 1 and h != r:
			leaf.add(h)
		else:
			for nxt in e[h]:
				if nxt != b:
					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)
for i in range(N):
	if i in leaf:
		dfs(i,i,i,0)
for i in range(N):
	print RL[i]