#include <bits/stdc++.h>
using namespace std;
int *dp[2000005], outt[2000005], la[2000005], *pos = la, dep[2000005];
int cnt, n, m, h[2000005], son[2000005];
struct wf {
  int to, nxt;
} edge[2000005 << 1];
void add(int u, int v) {
  edge[++cnt].to = v;
  edge[cnt].nxt = h[u];
  h[u] = cnt;
}
void dfs1(int u, int fa) {
  for (int i = h[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa) continue;
    dfs1(v, u);
    if (dep[v] > dep[son[u]]) son[u] = v;
  }
  dep[u] = dep[son[u]] + 1;
}
void dfs2(int u, int fa) {
  dp[u][0] = 1;
  if (son[u]) {
    dp[son[u]] = dp[u] + 1;
    dfs2(son[u], u);
    outt[u] = outt[son[u]] + 1;
  }
  for (int i = h[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa || v == son[u]) continue;
    dp[v] = pos;
    pos += dep[v];
    dfs2(v, u);
    for (int j = 1; j <= dep[v]; j++) {
      dp[u][j] += dp[v][j - 1];
      if ((outt[u] > j && dp[u][j] >= dp[u][outt[u]]) ||
          (outt[u] < j && dp[u][j] > dp[u][outt[u]]))
        outt[u] = j;
    }
  }
  if (dp[u][outt[u]] == 1) outt[u] = 0;
}
int main() {
  scanf("%d", &n);
  int u, v;
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &u, &v);
    add(u, v);
    add(v, u);
  }
  dfs1(1, 0);
  dp[1] = pos;
  pos += dep[1];
  dfs2(1, 0);
  for (int i = 1; i <= n; i++) printf("%d\n", outt[i]);
  return 0;
}
