from collections import defaultdict

class Graph:
    def __init__(self,V):
        self.vertices = V
        self.graph = defaultdict(list)
        self.degree = defaultdict(int)
        self.label = defaultdict(int)
        self.edges = []
        
    def add_edge(self,u,v):
        self.graph[u].append(v)
        self.degree[u] += 1
        self.degree[v] += 1
        self.label[(u,v)] = -1
        self.edges.append((u,v))
        

n = int(input())
g = Graph(n)

for _ in range(n-1):
    u,v = map(int,input().strip().split())
    g.add_edge(u,v)

g.degree = dict(sorted(g.degree.items(),key = lambda x:x[1]))

ass_label = 0
for key,val in g.degree.items():
    for node in g.graph[key]:
        if (key,node) in g.label and g.label[((key,node))]==-1:
            g.label[((key,node))] = ass_label
            ass_label += 1
        elif g.label[((node,key))]==-1:
            g.label[((node,key))] = ass_label
            ass_label += 1

for edge in g.edges:
    print(g.label[edge])
    
    
