#include <bits/stdc++.h>
using namespace std;
int main() {
  int a, b, i, n;
  int edges[int(2e5 + 1)][2], weights[int(2e5 + 1)], freq[int(2e5 + 1)];
  cin >> n;
  for (i = 1; i <= n; i++) freq[i] = 0;
  for (i = 0; i < n; i++) {
    weights[i] = -1;
    cin >> edges[i][0] >> edges[i][1];
    freq[edges[i][0]]++;
    freq[edges[i][1]]++;
  }
  int maxindex = 1, k = 0;
  for (i = 1; i <= n; i++)
    if (freq[i] > freq[maxindex]) maxindex = i;
  for (i = 0; i < n; i++)
    if (edges[i][0] == maxindex or edges[i][1] == maxindex) weights[i] = k++;
  for (i = 0; i < n; i++)
    if (weights[i] == -1) weights[i] = k++;
  for (i = 0; i < n - 1; i++) cout << weights[i] << endl;
  return 0;
}
