#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
vector<int> g[N];
int st[N], ft[N], ver[2 * N], sz[N], dis[N], timer;
int ans[N], cnt[N];
void pre(int x, int p) {
  st[x] = timer++;
  ver[st[x]] = x;
  sz[x] = 1;
  for (auto &u : g[x]) {
    if (u != p) {
      dis[u] = 1 + dis[x];
      pre(u, x);
      sz[x] += sz[u];
    }
  }
  ft[x] = timer++;
}
void dfs(int v, int p, bool keep) {
  int mx = -1, bigChild = -1;
  for (auto &u : g[v])
    if (u != p && sz[u] > mx) mx = sz[u], bigChild = u;
  for (auto &u : g[v])
    if (u != p && u != bigChild) dfs(u, v, 0);
  if (bigChild != -1) {
    dfs(bigChild, v, 1);
    mx = dis[bigChild] + ans[bigChild];
  }
  for (auto &u : g[v]) {
    if (u != p && u != bigChild) {
      for (int p = st[u]; p < ft[u]; p++) {
        if (ver[p]) {
          if (cnt[mx] < cnt[dis[ver[p]]] + 1) {
            mx = dis[ver[p]];
          } else if (cnt[mx] == cnt[dis[ver[p]]] + 1 && mx > dis[ver[p]]) {
            mx = dis[ver[p]];
          }
          cnt[dis[ver[p]]]++;
        }
      }
    }
  }
  if (cnt[mx] < cnt[dis[v]] + 1) {
    mx = dis[v];
  } else if (cnt[mx] == cnt[dis[v]] + 1 && mx > dis[v]) {
    mx = dis[v];
  }
  cnt[dis[v]]++;
  ans[v] = mx - dis[v];
  if (keep == 0) {
    for (int p = st[v]; p < ft[v]; p++) {
      if (ver[p]) cnt[dis[ver[p]]]--;
    }
  }
}
void solve() {
  int n;
  scanf("%d", &n);
  for (int i = 2; i <= n; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dis[1] = 1;
  pre(1, 0);
  dfs(1, 0, 1);
  for (int i = 1; i <= n; i++) printf("%d\n", ans[i]);
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
}
