#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));
template <class T>
long long upmax(T &a, T b) {
  return (b > a) ? a = b, 1 : 0;
}
template <class T>
long long upmin(T &a, T b) {
  return (b < a) ? a = b, 1 : 0;
}
vector<vector<pair<int, int>>> graph;
void solve() {
  int n;
  cin >> n;
  graph.resize(n);
  for (int i = 0, x, y; i < n - 1; i++) {
    cin >> x >> y;
    x--, y--, graph[x].push_back({y, i}), graph[y].push_back({x, i});
  }
  vector<int> ans(n - 1, -1);
  int what = 0;
  vector<bool> used(n, 0);
  queue<int> que;
  for (int i = 0; i < n; i++) {
    if (graph[i].size() == 1) que.push(i), used[i] = 1;
  }
  while (que.size()) {
    int v = que.front();
    que.pop();
    for (auto [nxt, id] : graph[v]) {
      if (ans[id] == -1) {
        ans[id] = what++;
        if (!used[nxt]) que.push(nxt), used[nxt] = 1;
      }
    }
  }
  for (auto i : ans) cout << i << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
