#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 15;
int n;
vector<pair<int, int>> adj[MAXN];
int par[MAXN];
int ver;
int ans[MAXN];
bool mark[MAXN];
void dfs(int v = 1, int p = -1);
int32_t main() {
  memset(ans, -1, sizeof(ans));
  cin >> n;
  for (int i = 0, u, v; i + 1 < n; i++) {
    cin >> u >> v;
    adj[u].push_back({v, i});
    adj[v].push_back({u, i});
  }
  if (n < 4) {
    if (n == 2) return cout << "0\n", false;
    return cout << "0 1\n", false;
  }
  for (int i = 0; i < n; i++)
    if (adj[i].size() > 2) ver = i;
  if (!ver) {
    for (int i = 0; i < n - 1; i++) {
      if (!i)
        cout << i << ' ';
      else if (i > 1)
        cout << i << ' ';
    }
    return cout << "1\n", false;
  }
  int id = 0;
  for (auto u : adj[ver]) ans[u.second] = id++;
  for (int i = 0; i + 1 < n; i++)
    if (ans[i] == -1) ans[i] = id++;
  for (int i = 0; i < n - 1; i++) cout << ans[i] << ' ';
  return cout << '\n', false;
}
