import math
import sys
from collections import defaultdict,Counter,deque,OrderedDict
import bisect
#sys.setrecursionlimit(1000000)
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
#def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
#INF = 10 ** 18
#MOD = 1000000000 + 7
from itertools import accumulate,groupby
import sys
mod = 1000000007

graph = []

def addEdge(a,b):
    graph[a].append(b)
    graph[b].append(a)


N = int(input())
graph =defaultdict(list);G = []
for i in range(N-1):
    u,v = ilele()
    addEdge(u,v)
    G.append((u,v))
Ans = {};maxi =0;a=0
for i,j in graph.items():
    if len(j) > maxi:
        maxi =len(j)
        a = i
k=0
for i in graph[a]:
    Ans[(i,a)] = k
    Ans[(a,i)] = k
    k+=1
#print(Ans)
for i in G:
    x = Ans.get(i,-1)
    if x!=-1:
        print(x)
    else:
        print(k)
        k+=1
        