#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  int n;
  cin >> n;
  vector<int> v[n];
  int c[n];
  mem(c);
  rep(i,n-1) {
    int x,y;
    cin >> x >> y;
    x--,y--;
    v[x].pb(y);
    v[y].pb(x);
    c[x]++;
    c[y]++;
  }
  int d[n],d2[n],u[n];
  mem(u);
  fill(d,d+n,MAX);
  fill(d2,d2+n,MAX);
  queue<int> que;
  REP(i,1,n) {
    if(c[i]==1) {
      que.push(i);
      d[i]=0;
    }
  }
  while(!que.empty()) {
    int x=que.front();que.pop();
    u[x]=1;
    if(!x) continue;
    rep(i,v[x].size()) {
      int y=v[x][i];
      d[y]=min(d[y],d[x]+1);
      c[y]--;
      if(c[y]==1&&!u[y]) que.push(y);
    }
  }
  d2[0]=0;
  que.push(0);
  while(!que.empty()) {
    int x=que.front();que.pop();
    rep(i,v[x].size()) {
      int y=v[x][i];
      if(d2[y]>d2[x]+1) {
        d2[y]=d2[x]+1;
        que.push(y);
      }
    }
  }
  rep(i,n) pr(min(d[i],d2[i]));
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}