#include <bits/stdc++.h>
using namespace std;
const int N = 12e5;
struct E {
  int x;
  E *nt;
  E(int x, E *nt) : x(x), nt(nt) {}
} * e[N];
bool u[N];
int hs[N];
int dfs(int x) {
  int l = 0;
  u[x] = 1;
  for (E *i = e[x]; i; i = i->nt)
    if (!u[i->x]) {
      int ld = dfs(i->x);
      if (ld > l) hs[x] = i->x, l = ld;
    }
  return l + 1;
}
int a[N];
int ans(int x, deque<int> &d) {
  if (x < 1 || u[x]) return 0;
  u[x] = 1;
  int b = ans(hs[x], d);
  a[x] = (b < 2 ? 0 : a[hs[x]] + 1);
  d.push_front(1);
  for (E *i = e[x]; i; i = i->nt) {
    if (i->x == hs[x]) continue;
    deque<int> dx;
    ans(i->x, dx);
    for (int i = 0; i < dx.size(); i++) {
      d[i + 1] += dx[i];
      if (d[i + 1] > b) {
        b = d[i + 1], a[x] = i + 1;
      } else if (d[i + 1] == b)
        a[x] = min(a[x], i + 1);
    }
  }
  return b;
}
int main() {
  int n;
  cin >> n;
  for (int i = 1, u, v; i < n; i++) {
    cin >> u >> v;
    e[u] = new E(v, e[u]);
    e[v] = new E(u, e[v]);
  }
  dfs(1);
  memset(u, 0, sizeof u);
  deque<int> d;
  ans(1, d);
  for (int i = 1; i <= n; i++) cout << a[i] << ' ';
  return 0;
}
