import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class EhAb {
    public static void main(String []args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String str = br.readLine();
        int t = Integer.parseInt(str);
        int [][]edge_list = new int[t-1][2];
        ArrayList<Integer> []graph = new ArrayList[t+1];
        for(int i = 1; i <= t; i++) graph[i] = new ArrayList<>();
        for(int i=0; i < (t-1); i++){
            String []st = br.readLine().split(" ");
            edge_list[i][0] = Integer.parseInt(st[0]);
            edge_list[i][1] = Integer.parseInt(st[1]);
            graph[edge_list[i][0]].add(edge_list[i][1]);
            graph[edge_list[i][1]].add(edge_list[i][0]);
        }
        int important[][]=new int[3][2];
        outer: for(int i = 1; i <= t; i++ ){
            if(graph[i].size()>2){
                for(int j = 0;j < 3; j++){
                    important[j][0] = i;
                    important[j][1] = graph[i].get(j);
                }
                break outer;
            }
        }
        int k=0;
        int []ans = new int[t-1];
        Arrays.fill(ans, -1);
        for(int i = 0; i < t - 1; i++ ){
            for(int flag=0;flag<3;flag++) {
                if (important[flag][0] == edge_list[i][0] && important[flag][1] == edge_list[i][1]) {
                    ans[i] = k++;
                } else if (important[flag][1] == edge_list[i][0] && important[flag][0] == edge_list[i][1]) {
                    ans[i] = k++;
                }
            }
        }


        for(int i = 0; i < t - 1; i++ ){
            if(ans[i]==-1){
                ans[i] = k++;
            }
            System.out.println(ans[i]);
        }

    }
}
