#include <bits/stdc++.h>
using namespace std;
vector<int> G[100005], id[100005];
int d[100005], ans[100005];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    d[u]++;
    d[v]++;
    G[u].push_back(v);
    G[v].push_back(u);
    id[u].push_back(i);
    id[v].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    if (d[i] >= 3) {
      ans[id[i][0]] = 1;
      ans[id[i][1]] = 2;
      ans[id[i][2]] = 3;
      int t = 3;
      for (int j = 1; j < n; j++)
        if (!ans[j]) ans[j] = ++t;
      for (int j = 1; j < n; j++) printf("%d\n", ans[j] - 1);
      return 0;
    }
  }
  for (int i = 1; i < n; i++) printf("%d\n", i - 1);
  return 0;
}
