import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
from functools import lru_cache
#sys.setrecursionlimit(200000000)
int1 = lambda x: int(x) - 1
#def input(): return sys.stdin.readline().strip()m
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
aj = lambda: list(map(int, input().split()))
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
#MOD = 1000000000 + 7
def Y(c):  print(["NO","YES"][c])
def y(c):  print(["no","yes"][c])
def Yy(c):  print(["No","Yes"][c])


G = defaultdict(list)
C = Counter()
order = []
def addEdge(a,b):
    G[a].append(b)
    G[b].append(a)
    C[a] += 1
    C[b] += 1
    order.append((a,b))

n, = aj()
for i in range(n-1):
    a,b = aj()
    addEdge(a,b)
    
# print(C)
# print(G)
E = []
for i in C.keys():
    E.append((C[i],i))
E.sort()
mark = {}
p = 0
for i,j in E:
    for l in G[j]:
        if mark.get((j,l),-1) == -1:
            mark[(j,l)] = p
            mark[(l,j)] = p
            p+=1
for i in order:
    print(mark[i])

    
    