

class Node:
    def __init__(self, val):
        self.left = None
        self.right = None
        self.value = val

class Tree:
    def __init__(self, n):
        self.root = None
        self.size = n

def mex(u, v):
    if max(u) > max(v):
        return u
    return v

def main():

    n = int(input())
    v = dict()

    # пропускаем первый элемент
    ans = [-1]
    # tree = Tree(n)
    for i in range(1, n):
        v[i] = []
        ans.append(-1)
    
    for i in range(1, n):
        a, b = [int(v) for v in input().split()]
        
        if not a in v:
            v[a] = []
        v[a].append(i)

        if not b in v:
            v[b] = []
        v[b].append(i)
        # print(i)

    # print(ans)

    mx = (0,0)
    for i in range(1, n):
        # print(i, mx, (len(v[i]), i))
        mx = max(mx, (len(v[i]), i))
        # print(i, mx, (len(v[i]), i))

    cur = 0
    for i in v[mx[1]]:
        ans[i] = cur
        cur += 1

    # print(ans)

    for i in range(1,n):
        if ans[i]==-1:
            ans[i] = cur
            cur += 1
        print(ans[i])


if __name__ == "__main__":
    main()
    