Problem: 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>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
int N, answer[maxn], at = 0;
vector<int> adj[maxn];
int main() {
  cin >> N;
  memset(answer, -1, sizeof(answer));
  int a, b;
  for (int i = 1; i < N; i++) {
    cin >> a >> b;
    a--;
    b--;
    adj[a].push_back(i);
    adj[b].push_back(i);
  }
  for (int i = 0; i < N; i++) {
    if (adj[i].size() > 2) {
      answer[adj[i][0]] = 0;
      answer[adj[i][1]] = 1;
      answer[adj[i][2]] = 2;
      at = 3;
      break;
    }
  }
  for (int i = 1; i < N; i++) {
    if (answer[i] == -1) {
      answer[i] = at;
      at++;
    }
  }
  for (int i = 1; i < N; i++) cout << answer[i] << "\n";
}