from collections import *
from sys import stdin, stdout


class graph:
    # initialize graph
    def __init__(self, gdict=None):
        if gdict is None:
            gdict = defaultdict(list)
        self.gdict, self.edges, self.l, self.visit = gdict, defaultdict(int), defaultdict(int), defaultdict(int)

    # add edge
    def add_edge(self, node1, node2, w=None):
        self.gdict[node1].append(node2)
        self.gdict[node2].append(node1)
        # self.edges[(node1, node2)] = 1
        self.l[node1] += 1
        self.l[node2] += 1

    def bfs_util(self, i):
        self.visit, self.diam, c, flag = defaultdict(int), defaultdict(int), 0, 0
        queue, self.visit[i] = deque([i]), 1

        while queue:
            # dequeue parent vertix
            s = queue.popleft()

            # enqueue child vertices
            for i in self.gdict[s]:
                if self.visit[i] == 0:
                    queue.append(i)
                    self.visit[i] = 1
                    self.edges[s, i], self.edges[i, s] = all[-1], all[-1]
                    all.pop()
        #             self.diam[i] += self.diam[s] + 1
        # return max(self.diam, key=self.diam.get)


edges, n = [], int(input())
g = graph()

for i in range(n - 1):
    u, v = map(int, stdin.readline().split())
    g.add_edge(u, v)
    edges.append([u, v])

all, ans = [i for i in range(n - 1)][::-1], []
# print(all,max(g.l, key=g.l.get))
g.bfs_util(max(g.l, key=g.l.get))

for i, j in edges:
    ans.append(str(g.edges[i, j]))
    
stdout.write('\n'.join(ans))
