#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e5 + 20;
int n, ans[N], num = -1;
vector<pair<int, int> > to[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = (1); i <= (n - 1); i++) {
    int u, v;
    cin >> u >> v;
    to[u].push_back(make_pair(v, i));
    to[v].push_back(make_pair(u, i));
  }
  memset(ans, -1, sizeof(ans));
  int flag = -1;
  for (int i = (1); i <= (n - 1); i++) {
    if (int(to[i].size()) > 2) flag = i;
  }
  if (flag != -1) {
    for (auto t : to[flag]) {
      ans[t.second] = ++num;
    }
  }
  for (int i = (1); i <= (n - 1); i++) {
    if (ans[i] == -1)
      cout << ++num;
    else
      cout << ans[i];
    cout << '\n';
  }
  return 0;
}
