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;
void testcase() {
  long long n;
  cin >> n;
  vector<vector<long long>> adjList(n + 1);
  vector<pair<long long, long long>> edges;
  for (long long i = 0; i < n - 1; i++) {
    long long a, b;
    cin >> a >> b;
    adjList[a].push_back(b);
    adjList[b].push_back(a);
    edges.emplace_back(a, b);
  }
  long long flag = 0;
  for (long long i = 1; i < n + 1; i++) {
    if (adjList[i].size() >= 3) {
      flag = i;
      break;
    }
  }
  if (flag == 0) {
    for (long long i = 0; i < n - 1; i++) {
      cout << i << "\n";
    }
  } else {
    long long count1 = 0;
    long long count2 = n - 2;
    for (long long i = 0; i < edges.size(); i++) {
      pair<long long, long long> edge = edges[i];
      if (edge.first == flag || edge.second == flag) {
        cout << count1 << "\n";
        count1++;
      } else {
        cout << count2 << "\n";
        count2--;
      }
    }
    assert(count1 - count2 == 1);
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testcase();
}
