from math import factorial
from collections import Counter, defaultdict
from heapq import heapify, heappop, heappush
import os
import sys
from io import BytesIO, IOBase
# region fastio

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# ------------------------------

def RL(): return map(int, sys.stdin.readline().rstrip().split())
def N(): return int(input())
def comb(n, m): return factorial(n) / (factorial(m) * factorial(n - m)) if n >= m else 0
def perm(n, m): return factorial(n) // (factorial(n - m)) if n >= m else 0
def mdis(x1, y1, x2, y2): return abs(x1 - x2) + abs(y1 - y2)
mod = 1000000007
INF = float('inf')

# ------------------------------


def main():
    n = N()
    rec = [0]*(n+1)
    gp = defaultdict(list)
    l, h = 0, n-2

    pr = []

    for _ in range(n-1):
        a, b = RL()
        pr.append([a, b])
        gp[a].append(b)
        gp[b].append(a)
        rec[a]+=1

    res = [-1]*(n+1)

    node = []
    for i, v in enumerate(rec):
        if i==0: continue
        if v==0:
            res[i] = l
            l+=1
            node.append(i)

    dt = False
    def dfs(node, par, tar, tag):
        nonlocal h, dt
        if node==tar:
            h = tag
            dt = True
            return
        if dt: return
        for nex in gp[node]:
            if nex==par: continue
            res[node] = tag
            dfs(nex, node, tar, tag-1)
            if dt: return
            res[node] = -1


    while node:
        a = gp[node.pop()][0]
        if not node: break
        b = gp[node.pop()][0]
        dfs(a, 0, b, h)

    for a, b in pr:
        if res[b]!=-1:
            print(res[b])
        else:
            print(l)
            l+=1



if __name__ == "__main__":
    main()