/* -*- coding: utf-8 -*-
 *
 * 277.cc: No.277 根掘り葉掘り - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int INF = 1 << 30;

/* typedef */

typedef vector<int> vi;

/* global variables */

vi nbrs[MAX_N];
int rs[MAX_N], ls[MAX_N];

/* subroutines */

int rec(int u, int prt, int r) {
  int minl = INF;
  vi &nbru = nbrs[u];
  for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
    int &v = *vit;
    if (v != prt) {
      int l = rec(v, u, r + 1) + 1;
      if (minl > l) minl = l;
    }
  }

  rs[u] = r;
  ls[u] = (minl >= INF) ? 0 : minl;

  return ls[u];
}

/* main */

int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    nbrs[x].push_back(y);
    nbrs[y].push_back(x);
  }

  rec(0, -1, 0);

  for (int i = 0; i < n; i++) {
    //printf("rs[%d]=%d, ls[%d]=%d\n", i, rs[i], i, ls[i]);
    printf("%d\n", min(rs[i], ls[i]));
  }
  return 0;
}