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 inf = 1 << 30;
const int N = 100100;
int n, a[N], q;
int deg[N];
int vis[N];
map<pair<int, int>, int> mp;
pair<int, int> p[N];
vector<int> adj[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    if (u > v) swap(u, v);
    p[i] = {u, v};
    adj[u].push_back(v);
    adj[v].push_back(u);
    deg[u]++;
    deg[v]++;
  }
  int rt = 1, mx = deg[1];
  for (int i = 2; i <= n; i++) {
    if (deg[i] > mx) {
      mx = deg[i];
      rt = i;
    }
  }
  queue<int> q;
  vis[rt] = 1;
  q.push(rt);
  int c = 0;
  while (q.size()) {
    int u = q.front();
    q.pop();
    for (auto v : adj[u]) {
      if (!vis[v]) {
        vis[v] = 1;
        mp[{min(u, v), max(u, v)}] = c++;
        q.push(v);
      }
    }
  }
  for (int i = 0; i < n - 1; i++) printf("%d\n", mp[p[i]]);
  return 0;
}
