#include <bits/stdc++.h>
using namespace std;
const int N = 200020;
int n, deg[N], ans[N];
vector<int> g[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    g[u].push_back(i);
    g[v].push_back(i);
  }
  for (int i = 1; i <= n; ++i) deg[i] = g[i].size();
  if (*max_element(deg + 1, deg + n + 1) <= 2) {
    for (int i = 0; i < n - 1; ++i) printf("%d\n", i);
    return 0;
  } else {
    memset(ans, -1, sizeof(ans));
    for (int i = 1; i <= n; ++i)
      if (deg[i] > 2) {
        ans[g[i][0]] = 0;
        ans[g[i][1]] = 1;
        ans[g[i][2]] = 2;
        break;
      }
    vector<int> v;
    for (int i = 3; i < n - 1; ++i) v.push_back(i);
    int cnt = 0;
    for (int i = 0; i < n - 1; ++i) {
      if (ans[i] == -1)
        printf("%d\n", v[cnt++]);
      else
        printf("%d\n", ans[i]);
    }
  }
}
