#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
vector<bool> use;
vector<int> ne;
vector<int> ha;

struct Edge{
	int to, rev;
};
vector<vector<Edge>> g;

void addEdge(int s,int t){
	Edge a = { t, g[t].size() };
	Edge b = { s, g[s].size() };
	g[s].push_back( a );
	g[t].push_back( b );
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	int N;
	cin >> N;
	
	g.resize(N);
	use.resize(N);
	ne.resize(N);
	ha.resize(N);
	int posA,posB;
	rep(i,N-1){
		cin >> posA >> posB;
		addEdge(posA-1,posB-1);
	}
	rep(i,N){
		use[i] = false;
		ne[i] = -1;
		ha[i] = -1;
	}
	
	queue<PII> q;
	use[0] = true;
	ne[0] = 0;
	q.push( PII( 0, ne[0] ) );

	PII temp;
	vector<Edge>::iterator it,end;
	while( !q.empty() ){
		temp = q.front();
		q.pop();
		it = g[temp.first].begin();
		end = g[temp.first].end();
		while( it != end ){
			if( !use[it->to] ){
				use[it->to] = true;
				ne[it->to] = temp.second + 1;
				q.push( PII(it->to,temp.second+1) );
			}
			++it;
		}
	}
	rep(i,N){
		use[i] = false;
	}
	for(int i=1;i<N; ++i){
		if( g[i].size() == 1 ){
			use[i] = true;
			ha[i] = 0;
			q.push( PII( i, 0) );
		}
	}

	while( !q.empty() ){
		temp = q.front();
		q.pop();
		it = g[temp.first].begin();
		end = g[temp.first].end();
		while( it != end ){
			if( !use[it->to] ){
				use[it->to] = true;
				ha[it->to] = temp.second + 1;
				q.push( PII(it->to,temp.second+1) );
			}
			++it;
		}
	}
	rep(i,N){
		P( min( ne[i], ha[i] ) );
	}
	return 0;
}