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() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  long long int u, v;
  unordered_map<long long int, long long int> mp;
  vector<pair<long long int, long long int>> ve;
  for (long long int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    ve.push_back({u, v});
    mp[u]++;
    mp[v]++;
  }
  long long int max1 = 0, pos = 0;
  for (long long int i = 1; i <= n; i++) {
    if (max1 < mp[i]) {
      max1 = mp[i];
      pos = i;
    }
  }
  long long int m = max1, j = 0;
  for (auto i : ve) {
    if (i.first == pos || i.second == pos) {
      cout << j;
      j++;
      cout << endl;
    } else {
      cout << m;
      m++;
      cout << endl;
    }
  }
  return 0;
}
