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>
import java.util.*;
import java.math.*;
public class Main {
	final static int maxn=(int)1e5+10;
	static int a[]=new int [maxn];
	static int b[]=new int [maxn];
	static Vector<Integer>vec[]=new Vector[maxn];
	static int ind[]=new int [maxn];
 public static void main(String args[])
 {
	 Scanner input=new Scanner(System.in);
	int n=input.nextInt();
	int maxsize=-1;int index=-1;
	for(int i=1;i<=n-1;i++)
	{
		int x,y;
		x=input.nextInt();y=input.nextInt();
		a[i]=x;b[i]=y;
		ind[x]++;ind[y]++;
		if(ind[x]>maxsize)
		{
			index=x;maxsize=ind[x];
		}
		if(ind[y]>maxsize)
		{
			index=y;maxsize=ind[y];
		}
	}
	
	if(n==2)
		System.out.println(0);
	else
	{
	if(maxsize==2)
	{
		for(int i=1;i<=n-1;i++)
			System.out.println(i-1);
	}
	else if(maxsize>=3) 
	{
		int cnt=3;
		for(int i=1,j=4;i<=n-1;i++)
		{
			if(a[i]!=index&&b[i]!=index||cnt==0)
				{System.out.println(j-1);j++;}
			else
			{
				if(cnt==3)
				{
					System.out.println(0);cnt--;
				}
				else if(cnt==2)
				{
					System.out.println(1);cnt--;
				}
				else if(cnt==1)
				{
					System.out.println(2);cnt--;
				}
			}
		}
	}
 }
}
}