#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100005;

vector<int> G[MAX_N];
int d[MAX_N];
int memo[MAX_N];

void dfs(int u,int p,int k)
{
    d[u] = k;
    rep(i,G[u].size()){
        if(G[u][i] != p){
            dfs(G[u][i],u,k+1);
        }
    }
}

int dp(int u,int p)
{
    if(G[u].size() == 1 && G[u][0] == p){
        memo[u] = 0;
        return 0;
    }
    if(memo[u] >= 0){
        return memo[u];
    }
    int mn = INF;
    rep(i,G[u].size()){
        if(G[u][i] != p){
            mn = min(mn,dp(G[u][i],u)+1);
        }
    }
    memo[u] = mn;
    return mn;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    rep(i,n-1){
        int a,b;
        cin >> a >> b;
        G[a-1].pb(b-1);
        G[b-1].pb(a-1);
    }
    dfs(0,-1,0);
    rep(i,n){
        memo[i] = -1;
    }
    dp(0,-1);
    rep(i,n){
        cout << min(d[i],memo[i]) << endl;
    }
    return 0;
}