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>
class Solution:
    def solve(self, n, queries):
        count = [0] * (n+1)
        node = 0
        for u, v in queries:
            count[u] += 1
            count[v] += 1
            if count[u] == 3:
                node = u
            if count[v] == 3:
                node = v
        ret = []
        i = 0
        j = 3 if node else 0
        for u, v in queries:
            if (u == node or v == node) and i < 3:
                ret.append(i)
                i += 1
            else:
                ret.append(j)
                j += 1
        return ret


def main():
    inp = lambda: [int(x) for x in input().split()]
    n = int(input())
    queries = [inp() for _ in range(n-1)]
    ans = Solution().solve(n, queries)
    for a in ans:
        print(a)


if __name__ == '__main__':
    main()
