#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

vector<vector<ll>> G;
vector<ll> ans;
void dfs(ll v, ll pv)
{
  if (pv >= 0)
  {
    ans.at(v) = ans.at(pv);
    ans.at(max(v, pv))++;
  }

  for (auto nv : G.at(v))
  {
    if (nv == pv)
      continue;
    dfs(nv, v);
  }
}

int main()
{
  ll N;
  cin >> N;
  G.resize(N);
  for (ll i = 0; i < N - 1; i++)
  {
    ll a, b;
    cin >> a >> b;
    a--, b--;
    G.at(a).push_back(b);
    G.at(b).push_back(a);
  }

  ans.assign(N, 0);
  dfs(0, -1);

  for (ll i = 0; i < N; i++)
  {
    cout << ans.at(i) << endl;
  }
}