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 sys
input = sys.stdin.readline
from collections import deque, defaultdict

def bfs(s):
    visited = [False]*n
    visited[s] = True
    q = deque([s])
    c = 0
    
    while q:
        v = q.popleft()
        
        for nv in G[v]:
            if not visited[nv]:
                k = min(v, nv)*10**6+max(v, nv)
                ans[k] = c
                visited[nv] = True
                q.append(nv)
                c += 1

n = int(input())
d = [0]*n
G = [[] for _ in range(n)]
edges = []

for _ in range(n-1):
    u, v = map(int, input().split())
    d[u-1] += 1
    d[v-1] += 1
    G[u-1].append(v-1)
    G[v-1].append(u-1)
    edges.append((min(u-1, v-1), max(u-1, v-1)))

ans = defaultdict(int)

for i in range(n):
    if d[i]>=3:
        mark = i
        break
else:
    mark = 0
    
bfs(mark)

for u, v in edges:
    print(ans[u*10**6+v])