#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 7;
map<long long, long long> ans;
vector<long long> g[N];
map<pair<long long, long long>, long long> d;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n;
  cin >> n;
  for (long long i = 0; i < n - 1; ++i) {
    long long u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
    d[make_pair(u, v)] = d[make_pair(v, u)] = i;
  }
  long long mx = 1;
  for (long long i = 1; i <= n; ++i) {
    if (g[i].size() > g[mx].size()) {
      mx = i;
    }
  }
  long long ptr = 0;
  for (long long i = 0; i < min(3ll, (long long)g[mx].size()); ++i) {
    long long v = g[mx][i];
    ans[d[make_pair(mx, v)]] = ptr++;
  }
  for (long long i = 0; i < n - 1; ++i) {
    if (ans.find(i) != ans.end()) {
      cout << ans[i] << '\n';
    } else {
      cout << ptr++ << '\n';
    }
  }
}
