#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mx = 2e5 + 10;
int posx[] = {1, -1, 0, 0};
int posy[] = {0, 0, 1, -1};
map<pair<int, int>, int> ans, vis;
bool visited[mx];
vector<int> tree[mx], adj(mx);
int curr;
void Dfs(int src) {
  visited[src] = true;
  for (auto x : tree[src]) {
    if (!visited[x]) {
      Dfs(x);
    }
    if (adj[x] == 1 && !vis[{src, x}]) {
      ans[{x, src}] = curr;
      ans[{src, x}] = curr++;
      vis[{src, x}] = true;
      vis[{x, src}] = true;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1, n, k, m, a, b, c, d;
  while (t--) {
    cin >> n;
    vector<pair<int, int> > ve;
    for (int i = 1; i < n; i++) {
      int u, v;
      cin >> u >> v;
      ve.push_back({u, v});
      tree[u].push_back(v);
      tree[v].push_back(u);
      adj[u]++, adj[v]++;
    }
    Dfs(1);
    for (auto x : ve) {
      int u = x.first, v = x.second;
      if (vis[{u, v}])
        cout << ans[{u, v}] << endl;
      else
        cout << curr++ << endl;
    }
  }
  return 0;
}
