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())

from collections import defaultdict
d = {}
d1 = defaultdict(list)
ans = [None for i in range(n-1)]
flag = 0
for i in range(n-1):
	a,b = map(int,input().split())

	d[(a,b)] = i
	d1[a].append(b)
	d1[b].append(a)
	if len(d1[a]) == 3 and flag == 0:

		if (a,d1[a][0]) in d:
			ans[d[(a,d1[a][0])]] = 0
		else:
			ans[d[(d1[a][0],a)]] = 0
		if (a,d1[a][1]) in d:
			ans[d[(a,d1[a][1])]] = 1
		else:
			ans[d[(d1[a][1],a)]] = 1
		if (a,d1[a][2]) in d:
			ans[d[(a,d1[a][2])]] = 2
		else:
			ans[d[(d1[a][2],a)]] = 2
		flag = 1
	if len(d1[b]) == 3 and flag == 0:
		if (b,d1[b][0]) in d:
			ans[d[(b,d1[b][0])]] = 0
		else:
			ans[d[(d1[b][0],b)]] = 0
		if (b,d1[b][1]) in d:
			ans[d[(b,d1[b][1])]] = 1
		else:
			ans[d[(d1[b][1],b)]] = 1
		if (b,d1[b][2]) in d:
			ans[d[(b,d1[b][2])]] = 2
		else:
			ans[d[(d1[b][2],b)]] = 2
		flag = 1
i = 0
if flag == 1:
	j = 3
else:
	j = 0
while i < len(ans):
	if ans[i] == None:
		ans[i] = j
		j = j + 1

	i = i + 1
for i in ans:
	print(i)
