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;
const int INF = 0x3f3f3f3f;
vector<pair<int, int> > each[100000 + 20];
int res[100000 + 20], used[100000 + 20];
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 2; i <= n; ++i) {
    int u, v;
    cin >> u >> v;
    each[u].push_back(make_pair(v, i));
    each[v].push_back(make_pair(u, i));
  }
  memset(res, -63, sizeof(res));
  int ok = 1;
  for (int i = 1; i <= n; ++i) {
    if (each[i].size() > 2) {
      int z = 0;
      used[0] = used[1] = used[2] = 1;
      for (auto it : each[i]) {
        res[it.second] = z++;
        if (z == 3) break;
      }
      break;
    }
  }
  int z = 3;
  if (!used[0]) z = 0;
  for (int i = 2; i <= n; ++i) {
    if (res[i] < 0) {
      cout << z++ << endl;
    } else {
      cout << res[i] << endl;
    }
  }
  return 0;
}
