#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, x, y, top, len[N], son[N], ans[N], head[N], tmp[N], *f[N], *id = tmp;
struct node {
  int too, next;
} edge[N * 2];
void add(int a, int b) {
  edge[++top].too = b;
  edge[top].next = head[a];
  head[a] = top;
}
void dfs(int u, int fa) {
  for (int i = head[u]; i; i = edge[i].next) {
    int v = edge[i].too;
    if (v == fa) continue;
    dfs(v, u);
    if (len[v] > len[son[u]]) son[u] = v;
  }
  len[u] = len[son[u]] + 1;
}
void dp(int u, int fa) {
  f[u][0] = 1;
  if (son[u]) {
    f[son[u]] = f[u] + 1;
    dp(son[u], u);
    ans[u] = ans[son[u]] + 1;
  }
  for (int i = head[u]; i; i = edge[i].next) {
    int v = edge[i].too;
    if (v == fa || v == son[u]) continue;
    f[v] = id;
    id += len[v];
    dp(v, u);
    for (int j = 1; j <= len[v]; j++) {
      f[u][j] += f[v][j - 1];
      if ((j < ans[u] && f[u][j] >= f[u][ans[u]]) ||
          (j > ans[u] && f[u][j] > f[u][ans[u]]))
        ans[u] = j;
    }
  }
  if (f[u][ans[u]] == 1) ans[u] = 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  dfs(1, 0);
  f[1] = id;
  id += len[1];
  dp(1, 0);
  for (int i = 1; i <= n; i++) printf("%d\n", ans[i]);
  return 0;
}
