#include <bits/stdc++.h>
const long long P = 1e9 + 7;
using namespace std;
map<int, int> m[1000010];
vector<int> G[1000010];
int d[1000010], res[1000010];
void dfs(int x, int fa) {
  d[x] = d[fa] + 1;
  res[x] = d[x];
  m[x][d[x]]++;
  for (auto t : G[x]) {
    if (t == fa) continue;
    dfs(t, x);
    if (m[x].size() < m[t].size()) swap(m[x], m[t]), res[x] = res[t];
    for (auto v : m[t]) {
      m[x][v.first] += v.second;
      if (m[x][v.first] + (v.first < res[x]) > m[x][res[x]]) res[x] = v.first;
    }
    m[t].clear();
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int j, k;
    scanf("%d%d", &j, &k);
    G[j].push_back(k);
    G[k].push_back(j);
  }
  dfs(1, 0);
  for (int i = 1; i <= n; i++) printf("%d\n", res[i] - d[i]);
  return 0;
}
