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:
from sys import stdin
n=int(input())
node=[[]for i in range(n+1)]
x=[]
m=dict()
for i in range(n-1):
    a,b=map(int,stdin.readline().split())
    x.append([a,b])
    m[a,b]=m[b,a]=-1
    node[a].append(b)
    node[b].append(a)
num=3
for i in range(1,n+1):
    if len(node[i])>=3:
        for i2 in range(3):
            m[node[i][i2],i]=m[i,node[i][i2]]=i2
        break
    if i==n:
        num=0
for i in range(n-1):
    if m[x[i][0],x[i][1]]>=0: print(m[x[i][0],x[i][1]])
    else:
        print(num)
        num+=1