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 vin(vector<long long int> &v, long long int t) {
  for (long long int i = 0; i < t; i++) cin >> v[i];
}
void vout(vector<long long int> &v, long long int t) {
  for (long long int i = 0; i < t; i++) cout << v[i] << " ";
  cout << endl;
}
void ingraph(vector<vector<long long int>> &graph, long long int m) {
  long long int x, y;
  for (long long int i = 0; i < m; i++) {
    cin >> x >> y;
    x--, y--;
    graph[x].push_back(y);
    graph[y].push_back(x);
  }
}
int main() {
  long long int n;
  cin >> n;
  vector<vector<long long int>> gr(n);
  long long int a, b;
  vector<long long int> ans(n - 1, -1);
  for (long long int i = 0; i < n - 1; i++) {
    cin >> a >> b;
    gr[--a].push_back(i);
    gr[--b].push_back(i);
  }
  long long int mx = 0, cur = 0;
  for (long long int i = 0; i < n; i++) {
    if (gr[i].size() > mx) {
      mx = gr[i].size();
      cur = i;
    }
  }
  long long int res = -1;
  for (long long int i = 0; i < gr[cur].size(); i++) ans[gr[cur][i]] = ++res;
  for (long long int i = 0; i < n - 1; i++) {
    if (ans[i] == -1) ans[i] = ++res;
  }
  for (long long int i = 0; i < n - 1; i++) cout << ans[i] << endl;
  return 0;
}
