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

public class File {
    public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }

            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }
    }
	
	
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
		
		
		
		
		
		
		
		int n = sc.nextInt();
		
		Map<Integer, List<Integer>> tree = new HashMap<>();
		for (int i = 0; i <= n; i++) {
			tree.put(i, new ArrayList<Integer>());
		}
		
		List<int[]> edges = new ArrayList<>();
		
		for (int i = 0; i < n-1; i++) {
			int u = sc.nextInt();
			int v = sc.nextInt();
			
			tree.get(u).add(i);
			tree.get(v).add(i);
			
			edges.add(new int[] {u, v});
		}
		
		
		int maxEdges = 0;
		for (int i = 1; i <= n; i++) {
			maxEdges = Math.max(maxEdges, tree.get(i).size());
		}
		
		if (maxEdges <= 2) {
			// If the max number of edges to a node is <= 2,
			// MEX is always n-1, because there's only a single path.
			for (int i = 0; i < n-1; i++) {
				out.println(i);
			}
		}
		else {
			// If for any node has > 2 edges from it, smallest MEX is always 2
				// set the node's edges to 0, 1, 2. There will never be
				// path with 0, 1 and 2 in it as a result.
				// The rest of edges can be anything.
			int tripleNode = -1;
			for (int i = 1; i <= n; i++) {
				if (tree.get(i).size() >= 3) {
					tripleNode = i;
					break;
				}
			}
			
			int[] edgeVal = new int[n-1];
			int val = 0;
            Set<Integer> set = new HashSet<Integer>();
            
			for (int edge : tree.get(tripleNode)) {
				edgeVal[edge] = val++;
				set.add(edge);
			}
			
			for (int edge = 0; edge < n-1; edge++) {
				if (!set.contains(edge)) {
					edgeVal[edge] = val++;
					set.add(edge);
				}
			}
			
			for (int res : edgeVal) {
				out.println(res);
			}
		}
		
		
		
		out.close();
	}
}








