#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

#define INF 10000000

int num;
vector<int> G[100005];
int ret[100005];
int visited[100005];

void dfs(int x, int r){
  visited[x] = num;
  if(ret[x] < r) return;
  ret[x] = min(ret[x], r);
  
  int cnt = 0;
  rep(i,G[x].size()){
    if(visited[G[x][i]] > num-1) continue;
    dfs(G[x][i], r+1);
    cnt++;
  }
}

int main(){
  int N;
  cin >> N;
  rep(i,N-1){
    int x, y;
    cin >> x >> y;
    G[x].push_back(y);
    G[y].push_back(x);
  }

  rep(i,100005) ret[i] = INF;
  
  dfs(1,0);
  num++;
  rep(i,N+1){
    if(G[i].size() == 1){
      dfs(i,0);
      num++;
    }
  }

  REP(i,1,N+1){
    cout << ret[i] << endl;
  }
  
  return 0;
}