import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
# import time,random,resource

# sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def IF(c, t, f): return t if c else f
def YES(c): return IF(c, "YES", "NO")
def Yes(c): return IF(c, "Yes", "No")


def main():
    t = 1

    rr = []
    for _ in range(t):
        n = I()
        a = [LI_() for _ in range(n-1)]

        d = {}
        e = collections.defaultdict(set)
        for i in range(n-1):
            u,v = a[i]
            e[u].add(v)
            e[v].add(u)
            d[(u,v)] = d[(v,u)] = i

        r = [-1] * (n-1)
        q = []
        for i in range(n):
            if len(e[i]) == 1:
                q.append(i)

        k = 0
        for i in range(n):
            t = q[i]
            for c in e[t]:
                ri = d[(t,c)]
                if r[ri] >= 0:
                    continue
                r[ri] = k
                k += 1
                e[c].remove(t)
                if len(e[c]) == 1:
                    q.append(c)

        rr.append(JA(r, "\n"))

    return JA(rr, "\n")


print(main())


