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:
n = int(input())
edge_count = [0]*100001
edge_list = []
for _ in range(n-1):
	u,v = map(int,input().split())
	edge_count[u]+=1
	edge_count[v]+=1
	edge_list.append([u,v])

min_val,max_val = 0,n-2
edge_weight = []
for i in range(len(edge_list)):
	if edge_count[edge_list[i][0]]==1 or edge_count[edge_list[i][1]] == 1:
		edge_weight.append(min_val)
		min_val+=1
	else:
		edge_weight.append(max_val)
		max_val-=1

for weight in edge_weight:
	print(weight)