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>
n = int(input())
a = [0 for _ in range(n)]
e = []
bl = [0] * n
cnt = 1
if n == 2:
    print(0)
    exit()

for i in range(n - 1):
    boof1, boof2 = map(int, input().split())
    boof1 -= 1
    boof2 -= 1
    a[boof1] += 1
    a[boof2] += 1
    e.append((boof1, boof2))

for i in range(n):
    if a[i] == 1:
        bl[i] = cnt
        cnt += 1

cnt2 = cnt
for i in range(n - 1):
    if bl[e[i][0]] != 0 or bl[e[i][1]] != 0:
        print(bl[e[i][0]] + bl[e[i][1]] - 1)
    else:
        print(cnt2 - 1)
        cnt2 += 1