#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline ll toInt(string s) { ll v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))

const ll mod = 1e9 + 7;
const ll INF = 1e9 + 9;

vector<int> to[100001];
int root[100001];
int leaf[100001];

int n;
void root_dfs(int m,int t){
	if (t >= root[m])return;
	root[m] = min(t, root[m]);
	rep(i, to[m].size()){
		root_dfs(to[m][i],t+1);
	}
}
void leaf_dfs(int m, int t){
	if (t >= leaf[m])return;
	leaf[m] = min(t, leaf[m]);
	rep(i, to[m].size()){
		leaf_dfs(to[m][i], t + 1);
	}
}

int main()
{
	fill(root, root + 100001, INF);
	fill(leaf, leaf + 100001, INF);

	cin >> n;
	rep(i, n-1){
		int x, y;
		cin >> x >> y;
		to[x].push_back(y);
		to[y].push_back(x);
	}

	//根の最小値の更新
	root_dfs(1, 0);
	//葉の最小値の更新
	For(i,2, n+1){
		if (to[i].size() == 1){
			leaf_dfs(i, 0);
		}
	}
	For(i, 1, n + 1){
		cout << min(root[i], leaf[i]) << endl;
	}

	return 0;
}