You are given a tree consisting of n nodes. You want to write some labels on the tree's edges such that the following conditions hold:

  * Every label is an integer between 0 and n-2 inclusive. 
  * All the written labels are distinct. 
  * The largest value among MEX(u,v) over all pairs of nodes (u,v) is as small as possible. 



Here, MEX(u,v) denotes the smallest non-negative integer that isn't written on any edge on the unique simple path from node u to node v.

Input

The first line contains the integer n (2 ≤ n ≤ 10^5) — the number of nodes in the tree.

Each of the next n-1 lines contains two space-separated integers u and v (1 ≤ u,v ≤ n) that mean there's an edge between nodes u and v. It's guaranteed that the given graph is a tree.

Output

Output n-1 integers. The i^{th} of them will be the number written on the i^{th} edge (in the input order).

Examples

Input


3
1 2
1 3


Output


0
1


Input


6
1 2
1 3
2 4
2 5
5 6


Output


0
3
2
4
1

Note

The tree from the second sample:

<image>
import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] u = new int[n - 1];
        int[] v = new int[n - 1];
        for (int i = 0; i < n - 1; ++i) {
            u[i] = sc.nextInt();
            v[i] = sc.nextInt();
        }

        System.out.println(solve(u, v));

        sc.close();
    }

    static String solve(int[] u, int[] v) {
        int n = u.length + 1;

        int[] degrees = new int[n + 1];
        for (int i = 0; i < u.length; ++i) {
            ++degrees[u[i]];
            ++degrees[v[i]];
        }

        int[] sortedIndices = IntStream.range(0, u.length).boxed().sorted((i1, i2) -> Integer
                .compare(Math.min(degrees[u[i1]], degrees[v[i1]]), Math.min(degrees[u[i2]], degrees[v[i2]])))
                .mapToInt(x -> x).toArray();

        int[] result = new int[u.length];
        for (int i = 0; i < result.length; ++i) {
            result[sortedIndices[i]] = i;
        }

        return Arrays.stream(result).mapToObj(String::valueOf).collect(Collectors.joining("\n"));
    }
}