import java.io.*;
import java.util.*;

public class patheticmex {

    static int[] estarts;
    static int[] eends;

    public static void main(String[] args) throws IOException {
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

        int n = Integer.parseInt(f.readLine());
        Node[] nodes = new Node[n];
        for(int i = 0; i < n; i++){
            nodes[i]=new Node(i+1, 0);
        }

        estarts = new int[n-1];
        eends = new int[n-1];
        for(int i = 0; i < n-1; i++){
            StringTokenizer st = new StringTokenizer(f.readLine());
            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            estarts[i]=a;
            eends[i]=b;

            nodes[a-1].od++;
            nodes[b-1].od++;
        }
        Arrays.sort(nodes);
        int chosen = nodes[0].i;
        int ctr = n-2;
        int chctr = 0;

        for(int i = 0; i < n-1; i++){
            int a = estarts[i];
            int b = eends[i];

            if(a != chosen && b != chosen){
                pw.print(ctr);
                if(i < n-2) pw.print(" ");
                ctr--;
            } else {
                pw.print(chctr);
                if(i < n-2) pw.print(" ");
                chctr++;
            }
        }

        pw.close();
    }

    static class Node implements Comparable<Node>{
        int i;
        int od;

        public Node(int ii, int oo){
            i=ii;
            od=oo;
        }

        @Override
        public int compareTo(Node o) {
            return o.od - od; // want largest out-degree to go first
        }
    }
}
