#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 10000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
//typedef pair<ll, ll> P;
typedef pair<P, int> PI;
typedef pair<int, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

#define N 100007
vector<int> g[N];
int n;
int ans[N];
int dist[N];
vector<int> le;

int dfs(int v, int c, int f) {
  int ret = N;
  if(g[v].size()==1 && g[v][0]==f) {
    le.push_back(v);
    ans[v] = 0;
    return 1;
  }
  rep(i, g[v].size()) {
    int t = g[v][i];
    if(t == f) continue;
    int r = dfs(t, c+1, v);
    ret = mind(ret, r);
  }
  ans[v] = mind(c, ret);
  dist[v] = ret;
  return ret+1;
}

void d_dfs(int v, int c, int f) {
  rep(i, g[v].size()) {
    int t = g[v][i];
    if(t == f) continue;
    if(c+1 <= dist[t]) {
      dist[t] = c+1;
      ans[t] = mind(ans[t], dist[t]);
      d_dfs(t, c+1, v);
    }
  }
}

int main() {
  cin >> n;
  rep(i, n-1) {
    int x, y;
    cin >> x >> y; --x; --y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  dfs(0, 0, -1);
  repe(e, le) {
    d_dfs(e, 0, -1);
  }
  rep(i, n) {
    cout << ans[i] << endl;
  }
  return 0;
}