#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const long long MOD = 998244353, MAX = 1e5 + 1;
int n;
vector<int> adj[MAX], vis(MAX);
deque<int> nums;
map<pair<int, int>, int> mp;
void dfs(int node, int src) {
  vis[node]++;
  for (auto i : adj[node]) {
    if (!vis[i]) {
      if (node == src)
        mp[{min(i, node), max(i, node)}] = 0, dfs(i, src);
      else {
        if (adj[i].size() == 1)
          mp[{min(i, node), max(i, node)}] = nums.front(), nums.pop_front(),
                                   dfs(i, src);
        else
          mp[{min(i, node), max(i, node)}] = nums.back(), nums.pop_back(),
                                   dfs(i, src);
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  int a[n - 1], b[n - 1];
  for (int i = 0; i < n - 1; i++) {
    cin >> a[i] >> b[i];
    adj[a[i]].push_back(b[i]);
    adj[b[i]].push_back(a[i]);
  }
  for (int i = 1; i < n - 1; i++) nums.push_back(i);
  vector<int> v;
  for (int i = 1; i < n + 1; i++)
    if (adj[i].size() == 1) v.push_back(i);
  dfs(v.front(), v.front());
  for (int i = 0; i < n - 1; i++)
    cout << mp[{min(a[i], b[i]), max(a[i], b[i])}] << "\n";
}
