#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

signed main(){
    int N; cin >> N;
    vector<vector<int>> G(N);
    rep(i, N - 1){
        int u, v; cin >> u >> v; u--, v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    vector<int> A(N, 0), B(N, 0);

    function<int(int, int)> f = [&](int cur, int par){
        for(auto &to : G[cur])if(to != par){
            A[to] = A[cur] + 1;
            f(to, cur);
        }
        return 0;
    };

    function<int(int, int)> g = [&](int cur, int par){
        int res = INF;
        for(auto &to : G[cur])if(to != par){
            chmin(res, g(to, cur));
        }
        if(res == INF) res = 0;
        else res++;
        B[cur] = res;
        return res;
    };
    
    f(0, -1);
    g(0, -1);

    rep(i, N) cout << min(A[i], B[i]) << "\n";
    return 0;
}