#include<bits/stdc++.h>
using namespace std;

//#define int long long

typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ln <<endl
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

const int SIZE=100000;

int N;
vint G[SIZE];
int dist[SIZE];

signed main(){
    scanf("%d",&N);
    rep(i,N-1){
        int a,b;
        scanf("%d%d",&a,&b);
        a--;b--;
        G[a].pb(b);G[b].pb(a);
    }

    queue<int>que;
    fill_n(dist,N,1<<25);
    rep(i,N){
        if(i==0||G[i].size()==1){
            dist[i]=0;
            que.push(i);
        }
    }

    while(que.size()){
        int v=que.front();que.pop();
        for(int to:G[v]){
            if(dist[to]<=dist[v]+1)continue;
            dist[to]=dist[v]+1;
            que.push(to);
        }
    }

    rep(i,N)printf("%d\n",dist[i]);
    return 0;
}