# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include <complex>
# include <bitset>
# include <random>
# include <chrono>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2147483647;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr double HDINF = 50000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
const double PI = acos(-1);
int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
# define ALL(x)      (x).begin(),(x).end()
# define UNIQ(c)     (c).erase(unique(ALL((c))),(c).end())
# define LOWER(s)    transform(ALL((s)),(s).begin(),TL<char>)
# define UPPER(s)    transform(ALL((s)),(s).begin(),TU<char>)
# define mp          make_pair
# define eb          emplace_back
# define FOR(i,a,b)  for(LL i=(a);i<(b);i++)
# define RFOR(i,a,b) for(LL i=(a);i>=(b);i--)
# define REP(i,n)    FOR(i,0,n)
# define INIT        std::ios::sync_with_stdio(false);std::cin.tie(0)

int n;
vector<int> G[101010];
int  d[101010],dha[101010];
bool isha[101010];


void bfs() {
	queue<int>que;
	//初期化
	for (int i = 0; i < 101010; i++)d[i] = INF;

	que.push(0);
	d[0] = 0;

	while (que.size()) {
		int p = que.front();
		que.pop();

		for (int i = 0; i < G[p].size(); i++) {
			if (d[G[p][i]] == INF) {
				que.push(G[p][i]);
				d[G[p][i]] = d[p] + 1;
			}
		}
	}
}

void bfs2() {
	queue<int>que;
	//初期化
	for (int i = 0; i < 101010; i++)dha[i] = INF;

	que.push(101009);
	dha[101009] = 0;

	while (que.size()) {
		int p = que.front();
		que.pop();

		for (int i = 0; i < G[p].size(); i++) {
			if (/*条件式&&*/dha[G[p][i]] == INF) {
				que.push(G[p][i]);
				dha[G[p][i]] = dha[p] + 1;
			}
		}
	}

}

int main() {
	cin >> n;
	REP(i, n-1) {
		int x, y;
		cin >> x >> y;
		x--, y--;
		G[x].emplace_back(y);
		G[y].emplace_back(x);
	}
	bfs();

	REP(i, n) {
		if (i) {
			if (G[i].size() == 1) {
				isha[i] = true;
			}
		}
	}
	REP(i, n) {
		if (isha[i]) {
			G[101009].emplace_back(i);
		}
	}
	bfs2();
	REP(i, n) {
		cout << min(d[i], dha[i]-1) << endl;
	}
	//system("pause");
}