#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
vl dp(100010,INF);
vvl g(100010);
void bfs(ll v,ll par=-1){
    for(auto p:g[v]){
        if(p==par)continue;
        chmin(dp[p],dp[v]+1);
        bfs(p,v);
    }
}
ll dfs(ll v,ll par=-1){
    ll ret=INF;
    for(auto p:g[v]){
        if(p==par)continue;
        chmin(ret,dfs(p,v));
    }
    if(ret==INF)ret=0;
    chmin(dp[v],ret);
    return ret+1;
}
int main(){
    ll n;cin >> n;
    rep(i,n-1){
        ll a,b;cin >>a  >> b;a--;b--;
        g[a].pb(b);g[b].pb(a);
    }
    dp[0]=0;
    bfs(0);
    dfs(0);
    bfs(0);
    rep(i,n)cout << dp[i] <<endl;
}