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

public class Main {
  public static void main(String[] args) throws IOException {
    InputStreamReader in = new InputStreamReader(System.in);
    BufferedReader br = new BufferedReader(in);

    int n = Integer.parseInt(br.readLine());
    
    int[][] edges = new int[n-1][3];

    ArrayList<ArrayList<Integer>> adjEdge = new ArrayList<>();
    int[][] nodeSize = new int[n][2];

    for (int i = 0; i < n; i++) {
      nodeSize[i][0] = i;
      adjEdge.add(new ArrayList<Integer>());
    }

    

    for (int i = 0; i < n-1; i++) {
      StringTokenizer st = new StringTokenizer(br.readLine());

      int u = Integer.parseInt(st.nextToken())-1;
      int v = Integer.parseInt(st.nextToken())-1;

      edges[i][0] = u;
      edges[i][1] = v;
      edges[i][2] = -1; //not visited

      adjEdge.get(u).add(i);
      adjEdge.get(v).add(i);

      nodeSize[u][1]++;
      nodeSize[v][1]++;
    }

    Arrays.sort(nodeSize, new Comparator<int[]>(){
      public int compare(int[] x, int[] y) {
        return x[1]-y[1];
      }
    });

    int currentVal = 0;

    for (int[] node : nodeSize) {
      int index = node[0];
      for (int edge : adjEdge.get(index)) {
        if (edges[edge][2] == -1) {
          edges[edge][2] = currentVal;
          currentVal++;
        }
      }
    }

    for (int[] edge : edges) {
      System.out.println(edge[2]);
    }
  }
}