from collections import *


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):
        if w != None:
            self.gdict[node1].append([node2, w])
            self.gdict[node2].append([node1, w])
        else:
            self.gdict[node1].append(node2)
            self.gdict[node2].append(node1)
        # self.edges[(node1, node2)] = 1
        self.l[node1] += 1
        self.l[node2] += 1

    def dfsUtil(self, v):
        stack, c = [v], 0

        while (stack):
            s = stack.pop()
            self.visit[v] = 1

            for i in self.gdict[s]:
                if not self.visit[i]:
                    stack.append(i)
                    self.visit[i] = 1
                    self.edges[s, i], self.edges[i, s] = c, c
                    c = (c + 2) % (n - 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)

    def diameter(self, v):
        first = self.bfs_util(v)
        second = self.bfs_util(first)
        return self.diam[second]


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

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

all = [i for i in range(1, n - 1)] + [0]
# g.bfs_util(1)
g.dfsUtil(1)

for i, j in edges:
    print(g.edges[i, j])
