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 long long int N = 1000000;
vector<long long int> g[N];
bool vis[N];
void solve() {
  long long int n, u, v;
  map<pair<long long int, long long int>, long long int> mp;
  vector<pair<long long int, long long int>> v1;
  cin >> n;
  for (long long int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
    v1.push_back({u, v});
  }
  if (n < 4) {
    for (long long int i = n - 2; i >= 0; i--) cout << i << "\n";
  } else {
    long long int i = 0;
    for (i = 1; i <= n; i++) {
      if (g[i].size() > 2) break;
    }
    if (i > n) {
      for (long long int i = n - 2; i >= 0; i--) cout << i << "\n";
    } else {
      mp[{i, g[i][1]}] = 1;
      mp[{i, g[i][2]}] = 3;
      mp[{g[i][0], i}] = 2;
      mp[{g[i][1], i}] = 1;
      mp[{g[i][2], i}] = 3;
      mp[{i, g[i][0]}] = 2;
      long long int k = 3;
      for (long long int j = 0; j < n - 1; j++) {
        if (mp[v1[j]] > 0)
          cout << mp[v1[j]] % 3 << "\n";
        else {
          cout << k << "\n";
          k++;
        }
      }
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
