from sys import stdin, exit
from itertools import combinations
from collections import deque
input = stdin.readline
lmi = lambda: list(map(int, input().split()))
mi = lambda: map(int, input().split())
si = lambda: input().strip('\n')
ssi = lambda: input().strip('\n').split()


# def dfs(u, p, s):
#     for i in graph[u]:
#         if i != p:
#             dfs(i, u, s+1)
#     global diameter
#     diameter = max(s, diameter)


n = int(input())
graph = [[] for i in range(n+1)]
edges = []
edges2 = {}
for i in range(n-1):
    a, b = mi()
    graph[a].append(b)
    graph[b].append(a)
    edges.append((a, b))
    edges2[(a, b)] = -1

if all(len(i) <= 2 for i in graph):
    for i in range(n-2, -1, -1):
        print(i)
else:
    for idx, i in enumerate(graph):
        if len(i) >= 3:
            for j in range(3):
                a, b = idx, graph[idx][j]
                if (a, b) not in edges2:
                    a, b = b, a
                edges2[(a, b)] = j
            break
    cnt = 3
    for a, b in edges2:
        if edges2[(a, b)] == -1:
            edges2[(a, b)] = cnt
            cnt += 1
    for a, b in edges:
        print(edges2[(a, b)])

# diameter = 0
# dfs(1, -1, 0)
# mex = n-diameter-1
# print(mex)