import io
import os

from collections import Counter, defaultdict, deque


def solve(N, edges):
    g = defaultdict(lambda: defaultdict(int))
    for i, (u, v) in enumerate(edges):
        g[u][v] = i
        g[v][u] = i
    maxDeg, maxNode = max((len(g[u]), u) for u in g.keys())

    if maxDeg <= 2:
        return "\n".join(map(str, range(N - 1)))
    else:
        out = [None for i in range(N - 1)]
        curr = 0
        for v, index in g[maxNode].items():
            out[index] = curr
            curr += 1
            if curr == 3:
                break

        for i in range(N - 1):
            if out[i] is None:
                out[i] = curr
                curr += 1

        return "\n".join(map(str, out))


if __name__ == "__main__":
    input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

    N, = [int(x) for x in input().split()]
    edges = [[int(x) for x in input().split()] for i in range(N - 1)]
    ans = solve(N, edges)
    print(ans)
