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;
const int N = 100005;
vector<int> E[N];
map<pair<int, int>, int> h;
int dp[N];
int ans[N], p[N];
int cnt = 0;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n - 1; i++) {
    ans[i] = -1;
    int first, second;
    cin >> first >> second;
    E[first].push_back(second);
    E[second].push_back(first);
    h[make_pair(first, second)] = h[make_pair(second, first)] = i;
  }
  for (int i = 1; i <= n; i++) {
    if (E[i].size() == 1) {
      if (h.find(make_pair(i, E[i][0])) != h.end()) {
        ans[h[make_pair(i, E[i][0])]] = cnt;
        cnt++;
        h.erase(make_pair(i, E[i][0]));
        h.erase(make_pair(E[i][0], i));
      }
    }
  }
  for (int i = 1; i < n; i++) {
    if (ans[i] == -1) {
      ans[i] = cnt;
      cnt++;
    }
  }
  for (int i = 1; i <= n - 1; i++) {
    cout << ans[i] << '\n';
  }
  return 0;
}
