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

public class Solution{
	public static void main(String[] args) {
	    Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
	    int n = in.nextInt();
	    int[][] arr = new int[n-1][2];
	    for (int i = 0; i < n-1; i++) {
	    	arr[i][0] = in.nextInt();
	    	arr[i][1] = in.nextInt();
	    }
	    int[] ans = solve(n, arr);
	    for (int i = 0; i < n-1; i++) System.out.println(ans[i]);
  	}

  	public static int[] solve(int n, int[][] arr){
  		int[] ans = new int[n-1];
  		Arrays.fill(ans, -1);
  		Map<Integer, Integer> degrees = new HashMap<>();
  		for (int i = 0; i < n-1; i++) {
  			degrees.put(arr[i][0], degrees.getOrDefault(arr[i][0], 0) + 1);
  			if (degrees.get(arr[i][0]) == 3) {
  				int t = 0, s = 3;
  				for (int j = 0; j < n-1; j++) {
  					if ((arr[j][0] == arr[i][0] || arr[j][1] == arr[i][0]) && t < 3) {
  						ans[j] = t;
  						t++;
  					} else {
  						ans[j] = s;
  						s++;
  					}
  				}
  				return ans;
  			}
  			degrees.put(arr[i][1], degrees.getOrDefault(arr[i][1], 0) + 1);
  			if (degrees.get(arr[i][1]) == 3) {
  				int t = 0, s = 3;
  				for (int j = 0; j < n-1; j++) {
  					if ((arr[j][0] == arr[i][1] || arr[j][1] == arr[i][1]) && t < 3) {
  						ans[j] = t;
  						t++;
  					} else {
  						ans[j] = s;
  						s++;
  					}
  				}
  				return ans;
  			}
  		}

  		Set<Integer> set = new HashSet<>();
  		for (int k: degrees.keySet()) {
  			if (degrees.get(k) == 1) set.add(k);
  		}

  		int t = 0, s = 2;
  		for (int i = 0; i < n-1; i++) {
  			if (set.contains(arr[i][0]) || set.contains(arr[i][1])) {
  				ans[i] = t;
  				t++;
  			} else {
  				ans[i] = s;
  				s++;
  			}
  		}

  		return ans;
  	}
}
