import sun.reflect.generics.tree.Tree;

import java.util.*;

public class Main {



    static int[] edgeCount;

    static int[] lastEdge;
    public static void main(String[] args) {

        Scanner s = new Scanner(System.in);

        int n = s.nextInt();

        edgeCount = new int[n+1];

        lastEdge = new int[n+1];

        for (int i =0; i < n-1; i++) {

            int first = s.nextInt();

            int second = s.nextInt();

            edgeCount[first] ++;

            edgeCount[second]++;

            lastEdge[first] = (i+1);

            lastEdge[second] = (i+1);
        }

        int zero = 0;
        int one = 0;

        int two = 0;

        for (int i = 1; i <= n; i++) {

            if (edgeCount[i] == 1) {

                if (zero == 0) zero = lastEdge[i];

                else if (one == 0) one = lastEdge[i];

                else if (two == 0) two = lastEdge[i];
            }
        }

        int startNum = 3;

        if (two == 0) startNum = 2;

        for (int i = 1 ; i <= n-1; i++) {


            if (i == zero)  System.out.println(0);

            else if (i == one) System.out.println(1);

            else if (i == two) System.out.println(2);

            else {

                System.out.println(startNum);

                startNum++;
            }
        }

    }












}
