import sys

def func(n,graph,kaunsa,d):
    cnt = 0
    ans = []
    for i in range(1, n+1):
        if len(graph[i])==1:
            cnt+= 1
    if cnt<3:
        for i in range(n-1):
            ans.append(i)
    else:
        for i in range(1, n+1):
            if len(graph[i])==1:
                not_found = str(i) + ' ' + str(graph[i][0])
                q = str(graph[i][0]) + ' ' + str(i)
                # q = q[-1::-1]
                # q = str(q[0])+' '+str(q[1])
                if not_found in d:
                    d[not_found] = 10**10
                else:
                    d[q] = 10**10
        here = cnt
        come = 0
        for i in kaunsa:
            if d[i] != 10**10:
                ans.append(here)
                here += 1
            else:
                ans.append(come)
                come += 1
    for i in ans:
        sys.stdout.write(str(i)+'\n')

n = int(sys.stdin.readline().rstrip().lstrip())
graph = [[] for i in range(n+1)]
kaunsa = []
d = {}
for i in range(n-1):
    u,v = list(map(int,sys.stdin.readline().rstrip().lstrip().split()))
    graph[u].append(v)
    graph[v].append(u)
    d[str(u)+' '+str(v)] = 1
    kaunsa.append(str(u)+' '+str(v))
ans = func(n,graph,kaunsa,d)
