from collections import Counter, defaultdict, deque
import bisect
from sys import stdin, stdout
from itertools import repeat
import math

# sys.stdin = open('input')

def inp():
    return map(int, raw_input().split())

def main():
        n = inp()[0]
        ans = [i for i in range(n-1)]
        G = defaultdict(list)
        for i in range(n-1):
            a, b = inp()
            a -= 1
            b -= 1
            G[a].append(i)
            G[b].append(i)
        need = []
        for i in range(n):
            if len(need) == 3:
                continue
            if len(G[i])==1:
                need.append(G[i][0])
        if len(need) == 3:
            # print need[0],ans[0], ans[need[0]]
            ans = [-1] * (n-1)
            ans[need[0]] = 0
            ans[need[1]] = 1
            ans[need[2]] = 2
            now = 3
            for i in range(n-1):
                if ans[i]==-1:
                    ans[i]=now
                    now+=1
        print '\n'.join(map(str, ans))

main()
