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 long long mxN = 2e5 + 1;
long long n;
vector<long long> adj[mxN];
long long ans[mxN];
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  memset(ans, -1, sizeof(ans));
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long a, b;
    cin >> a >> b;
    --a, --b;
    adj[a].push_back(i);
    adj[b].push_back(i);
  }
  long long mn = 0;
  for (long long i = 0; i <= n - 1; i++) {
    if (adj[i].size() > 2) {
      ans[adj[i][0]] = 0;
      ans[adj[i][1]] = 1;
      ans[adj[i][2]] = 2;
      mn = 3;
      break;
    }
  }
  for (long long i = 0; i < n - 1; i++) {
    if (ans[i] == -1) ans[i] = mn++;
  }
  for (long long i = 0; i < n - 1; i++) {
    cout << ans[i] << "\n";
  }
  return 0;
}