#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
using pll = pair<ll,ll>;
constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
constexpr int MOD = 1000000007;
int n = 100005;
vector<vector<int>> tree(n,vector<int>());
vector<int> R(n,0);
vector<int> L(n,0);

int dfs(int i,int p=-1,int d=0){
    R[i] = d;
    int res = INF;
    for(int c:tree[i]){
        if(c == p) continue;
        res = min(res,dfs(c,i,d+1)+1);
    }
    L[i] = (res==INF ? 0 : res);
    return L[i];
}

void dfs2(int i,int p=-1){
    if(p != -1) L[i] = min(L[i],L[p]+1);
    for(int c:tree[i]){
        if(c==p) continue;
        dfs2(c,i);
    }
}

int main(){
    cin >> n;
    rep(i,n-1){
        int a,b;
        cin >> a >> b;
        --a;--b;
        tree[a].push_back(b);
        tree[b].push_back(a);
    }
    dfs(0);
    dfs2(0);
    rep(i,n){
        cout << min(L[i],R[i]) << endl;
    }
    return 0;
}