#include "bits/stdc++.h"
using namespace std;
//諸機能
#pragma region MACRO
#define ANSWER(x) cerr << "answer: "; cout << (x) << endl
#define DOUBLE_ANSWER(x) cerr << "answer: "; cout << setprecision(10) << (double)(x) << endl
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define RREP(i,a,n) for(int i=(int)(n); i>= a; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define ALL(a) begin((a)),end((a))
#define FILL(a,n) for(auto &hoge : (a)) hoge = (n)
#define mp make_pair
#define EXIST(container, n) ((container).find((n)) != (container).end())
#define STOI(s,i,l) stoi(SUBSTR(s,i,l))
#define SUBSTR(s,i,l) string((s), (i), (l))
#define NPI_TO_RAD(x) (180.0*x/PI)
#define RAD_TO_NPI(x) (PI/180.0*x)
#pragma endregion
/*
//デバッグなどの支援
#pragma region CODING_SUPPORT
#define DEBUG1(var0) { std::cerr << ( #var0 ) << "=" << ( var0 ) << endl; }
#define DEBUG2(var0, var1) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; DEBUG2(var1, var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; DEBUG3(var1, var2, var3); }
#ifndef _DEBUG //デバッグでないなら、計算時間短縮のためにエラー出力を無効化
#define DEBUG1{}
#define DEBUG2{}
#define DEBUG3{}
#define DEBUG4{}
#endif
*/
//typedef（書き換える、書き足す可能性ある）
#pragma region TYPE_DEF
typedef long long ll; 
typedef pair<int,int> pii;
typedef pair<string,string> pss;
typedef pair<int,string>pis;
typedef pair<string,int>psi;
typedef vector<string> vs;
typedef vector<int> vi;
#pragma endregion
//諸々の定数(書き換える可能性ある)
#pragma region CONST_VAL
#define PI (2*acos(0.0))
#define EPS (1e-9)
#define MOD (int)(1e9 + 7)
#pragma endregion



int l[100000];
vector<int> link[10000];

void l_search(int n) 
{
	if (link[n].size() == 0)
	{
		l[n] = 0;
		return;
	}
	rep(i, link[n].size())
	{
		l_search(link[n][i]);
		l[n] = min(l[n], l[link[n][i]] +1);
	}
}

int main()
{
	int n;
	cin >> n;

	int r[100000];

	FILL(r,-1);
	FILL(l, 10000000);
	queue<pii> q;
	rep(i, n-1)
	{
		int x, y;
		cin >> x >> y;
		link[x - 1].push_back(y-1);
		q.push(mp(x-1, y-1));
	}
	r[0] = 0;
	while (!q.empty())
	{
		pii t = q.front();
		q.pop();
		if (r[t.first] != -1)
		{
			r[t.second] = r[t.first] + 1;
		}
		else if (r[t.second]!=-1)
		{
			r[t.first] = r[t.second] + 1;
		}
		else
		{
			q.push(t);
		}
	}
	l_search(0);
	rep(i, n)
	{
		ANSWER(min(r[i], l[i]));
	}
	return 0;

}