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>
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<tuple<int, int, int> > tp(n - 1);
  int a, b;
  unordered_map<int, int> mp;
  int i;
  int p = -1;
  for (i = 0; i < n - 1; i++) {
    cin >> a >> b;
    get<0>(tp[i]) = a;
    get<1>(tp[i]) = b;
    get<2>(tp[i]) = (-1);
    mp[a]++;
    mp[b]++;
    if (mp[a] == 3 && p == (-1)) {
      p = a;
    } else if (mp[b] == 3 && p == (-1)) {
      p = b;
    }
  }
  if (p != (-1)) {
    int count = 3;
    int z = 2;
    for (i = 0; i < n - 1; i++) {
      if ((get<0>(tp[i]) == p || get<1>(tp[i]) == p) && (z + 1)) {
        get<2>(tp[i]) = z;
        z--;
        continue;
      }
      get<2>(tp[i]) = count;
      count++;
    }
  } else {
    int count = 0;
    for (i = 0; i < n - 1; i++) {
      get<2>(tp[i]) = count;
      count++;
    }
  }
  for (int i = 0; i < n - 1; i++) {
    cout << get<2>(tp[i]) << "\n";
  }
}
