import sys
sys.setrecursionlimit(1000000)
N = int(input())
G = {i:[] for i in range(1,N+1)}
for _ in range(N-1):
    a,b = map(int,input().split())
    G[a].append(b)
    G[b].append(a)
A = [[0,0] for _ in range(N+1)]
cnt = 0
def dfs(u,pu):
    global cnt
    for v in G[u]:
        if v==pu:continue
        if v>u:
            A[v][0] = A[u][0]+1
            A[v][1] = A[u][1]
        else:
            A[v][0] = A[u][0]
            A[v][1] = A[u][1]+1
            cnt += 1
        dfs(v,u)
dfs(1,0)
print(cnt)
for i in range(2,N+1):
    print(cnt+A[i][0]-A[i][1])