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>
#!/usr/bin/env python
# coding: utf-8

# In[83]:


n = int(input())
edges = []
degrees = [0]
for i in range(n):
    degrees.append(0)


# In[84]:


output = []
for i in range(n-1):
    output.append(-1)
    


# In[85]:


def d3():
    d3_vertex = 0
    for i in range(n+1):
        if ( degrees[i] > 2 ):
            d3_vertex = i
    return d3_vertex


# In[86]:


for i in range (n-1):
    inp = input().split()
    inp = [int(i) for i in inp]
    
    inp.sort()
    edges.append(inp)
    
    degrees[inp[0]]= degrees[inp[0]] +1
    degrees[inp[1]]= degrees[inp[1]] +1


# In[91]:


f = d3()
if (f > 0):
    u = 0;
    for i in range(n-1):
        if(edges[i][0]==f or edges[i][1]==f):
            output[i] = u
            u = u+1
            
    for i in range(n-1):
        if(output[i]==-1):
            output[i] = u
            u = u+1     
            
    for i in range(n-1):
        print(output[i])
    
else:
    for i in range(n-1):
        print(i)


# In[ ]:




