#include <bits/stdc++.h>

using namespace std;

const int INF = 1e7;

vector< vector<int> > G;
vector<int> R, L;

void dfs(int cur, int par) {
	for (int nex : G[cur]) {
		if (nex == par) continue;
		R[nex] = R[cur] + 1;
		dfs(nex, cur);
		L[cur] = min(L[cur], L[nex]);
	}
	if (L[cur] == INF) L[cur] = 0;
	else L[cur]++;
}

void dfs2(int cur, int par) {
	if (par != -1) L[cur] = min(L[cur], L[par] + 1);
	for (int nex : G[cur]) {
		if (nex == par) continue;
		dfs2(nex, cur);
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	G.resize(n);
	for (int i = 1; i < n; i++) {
		int x, y;
		cin >> x >> y;
		x--;
		y--;
		G[x].push_back(y);
		G[y].push_back(x);
	}

	R.resize(n, INF);
	L.resize(n, INF);
	R[0] = 0;
	dfs(0, -1);
	dfs2(0, -1);
	
	for (int i = 0; i < n; i++) {
		cout << min(R[i], L[i]) << endl;
	}
	return 0;
}