#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

int N;
vector<int> tree[100001];
vector<int> deg;
int dist[100001];

void bfs() {

  rep(i, N) dist[i] = 1e9;

  queue<pair<int, int>> q;
  vector<bool> vis(N);
  q.emplace(0, 0);
  vis[0] = 1;  
  dist[0] = 0;
  rep(i, N) {
    if(deg[i] == 1) q.emplace(i, 0), dist[i] = 0, vis[i] = 1;
  }

  while(!q.empty()) {
    auto p = q.front(); q.pop();
    dist[p.first] = min(dist[p.first], p.second);
    rep(i, tree[p.first].size()) {
      int tar = tree[p.first][i];
      if(vis[tar]) { continue; }
      vis[tar] = 1;
      q.emplace(tar, p.second+1);
    }
  }

}

int main() {

  cin >> N;
  deg.resize(N);
  rep(i, N-1) {
    int x, y; cin >> x >> y;
    x--, y--;
    deg[x]++, deg[y]++;
    tree[x].push_back(y);
    tree[y].push_back(x);
  }

  bfs();
  rep(i, N) cout << dist[i] << endl;

  return 0;
}