#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define LP pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
template<class T>
void chmax(T& a, T b) { a = max(a, b); };
template<class T>
void chmin(T& a, T b) { a = min(a, b); };

int dist[100005];
vector<int> g[100005];
int ans[100005];

void dfs(int v, int p = -1) {
  if (p != -1 && v < p) ans[0]++;
  for (auto nv : g[v]) {
    if (nv == p) continue;
    dfs(nv, v);
  }
  return;
}

void dfs2(int v, int p = -1) {
  if (p != -1 && v < p) ans[v] = ans[p]-1;
  if (p != -1 && v > p) ans[v] = ans[p]+1;
  for (auto nv : g[v]) {
    if (nv == p) continue;
    dfs2(nv, v);
  }
  return;

}

int main() {
  int n;
  cin >> n;
  rep(i,n-1) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    g[a].pb(b);
    g[b].pb(a);
  }
  dfs(0);
  dfs2(0);
  rep(i,n) cout << ans[i] << "\n";
  
  return 0;
}