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>
'use strict'

const getLine = () => readline().split(' ')
const getInts = () => getLine().map(n => parseInt(n))
const getInt = () => getInts()[0]
const D = (...args) => { // D({name})
  [...args].forEach(cur => print.apply(print, [JSON.stringify(cur)]))
}

main()

function main() {
  const n = getInt()
  const inc = new Array(n + 1).fill(0)
  const G = []
  const ans = {}
  const out = []
  for (let i = 1; i < n; ++i) {
    const ab = getInts()
    const a = ab[0]
    const b = ab[1]
    out.push(make_pair(a, b))

    inc[a] ++
    inc[b] ++
    if (!G[a]) G[a] = []
    if (!G[b]) G[b] = []

    G[a].push(b)
    G[b].push(a)
    ans[make_pair(a, b)] = -1
  }

  let node = -1
  let mx = 0
  for (let i = 1; i <= n; ++i) {
    if (inc[i] > mx) {
      mx = inc[i]
      node = i
    }
  }

  let cnt = 0
  for (let i = 0; i < G[node].length; ++i) {
    const other = G[node][i]
    ans[make_pair(node, other)] = cnt ++
  }

  for (let i in ans) {
    if (ans[i] === -1) ans[i] = cnt ++
  }
  
  for (let i in out) {
    print(ans[out[i]])
  }
}

function make_pair (a, b) {
  const arr = [a, b]
  arr.sort()
  return arr[0] + '-' + arr[1]
}
