import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.HashMap;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        List<List<Integer>> graph = new ArrayList<>();
        Map<Integer, Map<Integer, Integer>> colore = new HashMap<>();

        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            for (int i = 0; i < n; i++) {
                graph.add(new ArrayList<>());
            }
            List<Integer> order = new ArrayList<>();
            for (int i = 0; i < n - 1; i++) {
                int v, u;
                v = in.nextInt() - 1;
                u = in.nextInt() - 1;
                addEdge(v, u);
                addEdge(u, v);
                order.add(v);
                order.add(u);
            }
            int start = 0;
            for (int i = 0; i < n; i++) {
                if (graph.get(i).size() >= 3) {
                    int v = i;
                    for (int j = 0; j < graph.get(i).size(); j++) {
                        int u = graph.get(i).get(j);

                        if (!colore.containsKey(v))
                            colore.put(v, new HashMap<>());
                        colore.get(v).put(u, start);
                        if (!colore.containsKey(u))
                            colore.put(u, new HashMap<>());
                        colore.get(u).put(v, start);
                        start++;
                    }
                }
            }

            for (int i = 0; i < order.size(); i += 2) {
                int v = order.get(i);
                int u = order.get(i + 1);
                if (colore.containsKey(v) && colore.get(v).containsKey(u)) {
                    out.println(colore.get(v).get(u));
                } else {
                    out.println(start);
                    start++;
                }
            }
        }

        private void addEdge(int v, int u) {
            graph.get(v).add(u);
        }

    }
}

