from collections import deque

import sys
input = sys.stdin.readline
n = int(input())
g = [[] for x in range(n)]
ed = {}
el = []
for ei in range(n-1):
    s, e = [int(x) for x in input().strip().split()]
    el.append((s, e))
    g[s-1].append(e-1)
    g[e-1].append(s-1)
nc = [0]*n
v = [0]*n
d = deque()
for node in range(n):
    nc[node] = len(g[node])
    if nc[node] == 1:
        d.append(node)
ce = 0
while d:
    nn = d.popleft()
    v[nn] = 1
    nc[nn] -= 1
    for ni in g[nn]:
        if not v[ni]:
            nc[ni] -= 1
            if nc[ni] == 1:
                d.append(ni)
            ed[(ni+1, nn+1)] = ce
            ed[(nn+1, ni+1)] = ce
            ce += 1
for eli in el:
    print(ed[eli])
            
