# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, UV):
    c = Counter()
    for u, v in UV:
        c[u] += 1
        c[v] += 1
    rn = 0
    for v in c.values():
        if v == 1:
            rn += 1

    ri = 0
    nri = rn
    ans = []
    for u, v in UV:
        if c[u] == 1 or c[v] == 1:
            ans.append(ri)
            ri += 1
        else:
            ans.append(nri)
            nri += 1
    return ans


def main():
    N = read_int()
    UV = [read_int_n() for _ in range(N-1)]
    print('\n'.join(map(str, slv(N, UV))))


if __name__ == '__main__':
    main()
