#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

#define MAX_V 100000

int n;
vector <int> graph[MAX_V+1];
int memo1[MAX_V+1], memo2[MAX_V+1];
bool vis[MAX_V+1];
void rec1(int x, int t) {
  memo1[x] = t;
  vis[x] = true;
  for (int i = 0; i < graph[x].size(); i++) {
    int p = graph[x][i];
    if (vis[p]) continue;
    rec1(p, t+1);
  }
}

void rec2(int x, int t) {
  for (int i = 0; i < graph[x].size(); i++) {
    int p = graph[x][i];
    if (memo2[p] == -1 || memo2[p] > t+1) {
      memo2[p] = t+1;
      rec2(p, t+1);
    }
  }
}

int main() {
  scanf("%d", &n);
  for (int i = 0; i < n-1; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    a--; b--;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  memset(vis, false, sizeof(vis));
  rec1(0, 0);
  for (int i = 0; i < n; i++) {
    if (graph[i].size() == 1) {
      graph[i].push_back(n);
      graph[n].push_back(i);
    }
  }

  memset(vis, false, sizeof(vis));
  memset(memo2, -1, sizeof(memo2));
  memo2[n] = 0;
  rec2(n, -1);
  for (int i = 0; i < n; i++) {
    printf("%d\n", min(memo1[i], memo2[i]));
    // printf("%d\n", memo2[i]);
  }

}