import java.io.*;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Random;
import java.util.StringTokenizer;

public class C {

    public static void main(String[] args) {
        FastReader scan = new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        Task solver = new Task();
        int t = 1;
        for(int tt = 1; tt <= t; tt++) solver.solve(tt, scan, out);
        out.close();
    }

    static class Task {
        static int n;
        static ArrayList<Edge>[] adj;
        static int[] ans;
        static int[] parity;
        static boolean[] visited;

        public void solve(int testNumber, FastReader scan, PrintWriter out) {
            n = scan.nextInt();
            adj = new ArrayList[n];
            ans = new int[n - 1];
            parity = new int[n];
            visited = new boolean[n];
            for(int i = 0; i < n; i++) adj[i] = new ArrayList<>();
            for(int i = 0; i < n - 1; i++) {
                int a = scan.nextInt() - 1, b = scan.nextInt() - 1;
                adj[a].add(new Edge(b, i));
                adj[b].add(new Edge(a, i));
            }
            int start = 0, end = n - 2;
            visited[0] = true;
            ArrayDeque<Edge> queue = new ArrayDeque<>();
            queue.addLast(new Edge(0, -1));
            while(!queue.isEmpty()) {
                Edge q = queue.pollFirst();
                if(q.index != -1 && parity[q.to] == 0) ans[q.index] = start++;
                else if(q.index != -1) ans[q.index] = end--;
                for(Edge i : adj[q.to]) {
                    if(!visited[i.to]) {
                        visited[i.to] = true;
                        parity[i.to] = parity[q.to] ^ 1;
                        queue.addLast(i);
                    }
                }
            }
            for(int i : ans) out.println(i);
        }

        static class Edge {
            int to;
            int index;

            public Edge(int a, int b) {
                to = a;
                index = b;
            }
        }

    }

    static void shuffle(int[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            int temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }
    }

    static void shuffle(long[] a) {
        Random get = new Random();
        for (int i = 0; i < a.length; i++) {
            int r = get.nextInt(a.length);
            long temp = a[i];
            a[i] = a[r];
            a[r] = temp;
        }
    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

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

        public FastReader(String s) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(new File(s)));
        }

        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());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

}