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>
def solve(graph):
    ans = [-1 for i in range(len(graph) - 1)]
    for v in graph:
        if len(graph[v]) > 2:
            for i, (u, k) in enumerate(graph[v][:3]):
                ans[k] = i
            k = 0
            for i in range(3, len(ans)):
                while ans[k] != -1:
                    k += 1
                ans[k] = i
            return ans
    return list(range(len(graph) - 1))


def test():
    g1 = {1: [(2, 0), (3, 1)], 2: [(1, 0)], 3: [(1, 1)]}
    s1 = solve(g1)
    print(s1)
    assert s1 == [0, 1]
    g2 = {1: [(2, 0), (3, 1)], 2: [(1, 0), (4, 2), (5, 3)], 3: [(1, 1)], 4: [(2, 2)], 5: [(2, 3), (6, 5)], 6: [(5, 5)]}
    s2 = solve(g2)
    print(s2)
    assert s2 == [0, 3, 1, 2, 4]

if __name__ == '__main__':
    # test()
    n = int(input())
    graph = {i : [] for i in range(1, n + 1)}
    edges = []
    for i in range(n - 1):
        u, v = [int(c) for c in input().split()]
        graph[u].append((v, i))
        graph[v].append((u, i))
    ans = solve(graph)
    print(*ans, sep='\n')
