#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int values[N] = {};
vector<pair<int, int>> g[N];
bool cmp(vector<pair<int, int>> a, vector<pair<int, int>> b) {
  return a.size() > b.size();
}
void solve(int n) {
  int m = 0;
  for (int i = 0; i < n; ++i) {
    for (auto& p : g[i]) {
      if (values[p.second] == -1) {
        values[p.second] = m;
        m++;
        if (m > n - 2) return;
      }
    }
  }
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    g[u].emplace_back(make_pair(v, i));
    g[v].emplace_back(make_pair(u, i));
  }
  fill(values, values + n, -1);
  sort(g, g + n, cmp);
  solve(n);
  for (int i = 0; i < n - 1; ++i) {
    cout << values[i] << endl;
  }
}
