n = int(input()) graph = [[] for _ in range(n)] for _ in range(n-1): x, y = map(int, input().split()) x -= 1 y -= 1 graph[x].append(y) graph[y].append(x) R = [n]*n R[0] = 0 nodes = [0] for i in nodes: for j in graph[i]: if R[j] == n: R[j] = R[i]+1 nodes.append(j) L = [n]*n leafs = [] for i in range(1, n): if len(graph[i]) == 1: L[i] = 0 leafs.append(i) for i in leafs: for j in graph[i]: if L[j] == n: leafs.append(j) L[j] = min(L[j], L[i]+1) for i in map(min, R, L): print(i)