"""    Arnab Chanda    """

from collections import defaultdict, deque
from itertools import permutations
from sys import stdin,stdout
from bisect import bisect_left, bisect_right
from copy import deepcopy
import heapq

int_input=lambda : int(stdin.readline())
string_input=lambda : stdin.readline().split()
multi_int_input =lambda : map(int, stdin.readline().split())
multi_input = lambda : stdin.readline().split()
list_input=lambda : list(map(int,stdin.readline().split()))
string_list_input=lambda: list(string_input())
MOD = pow(10,9)+7

n = int_input()
mini = 0
graph = []
for i in range(n+5):
    graph.append([])
inputorder = []
ans = []
frequency = {}

if n == 2:
    u,v = multi_int_input()
    print(0)

elif n == 3:
    a,b= multi_int_input()
    b,c = multi_int_input()
    print(0)
    print(1)

else:
    count = 0
    for _ in range(n-1):
        u,v = multi_int_input()
        inputorder.append([u,v])
        graph[u].append(v)
        graph[v].append(u)

    threeDegreePoint = -1
    for i in range(1,n+1):
        if len(graph[i]) == 3:
            threeDegreePoint = i

    if threeDegreePoint == -1:
        for i in range(0,n-1):
            print(i)

    else:
        a = 0
        b = 3
        for x in inputorder:
            if x[0] == threeDegreePoint or x[1] == threeDegreePoint:
                print(a)
                a+=1
            else:
                print(b)
                b+=1