Problem: 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>

Solution (in PYTHON3):

Solution:
t=int(input())
count=[0]*100005
a=[]
for j in range(t-1):
    
    x1,x2=map(int,input().split())
    count[x1]+=1 
    count[x2]+=1 
    a.append([x1,x2]) 
k=0 
l=t-2
# print(count[:5])
# print(a)
ans =[]
for i in range(len(a)):
    if count[a[i][0]]==1 or count[a[i][1]]==1 :
        # print(a[i][0],a[i][1])
        ans.append(k)
        k+=1 
    else:
        # print(a[i][0],a[i][1])

        ans.append(l)
        # print(ans)
        l-=1 
for i in range(len(ans)):
    print(ans[i])