#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
bool bo[100010] = { false };
int r[100010], l[100010];
vector<vector<int>> vec(100010);
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n - 1; i++) {
		int x, y;
		cin >> x >> y;
		vec[x].emplace_back(y);
		vec[y].emplace_back(x);
		bo[x] = true;
	}
	queue<int> que, que1;
	que.push(1);
	for (int i = 1; i <= n; i++) {
		r[i] = 1000000007, l[i] = 1000000007;
		if (!bo[i]) {
			que1.push(i);
			l[i] = 0;
		}
	}
	r[1] = 0;
	while (!que.empty()) {
		int now = que.front();
		que.pop();
		for (int i = 0; i < vec[now].size(); i++) {
			if (r[vec[now][i]] == 1000000007) {
				r[vec[now][i]] = r[now] + 1;
				que.push(vec[now][i]);
			}
		}
	}
	while (!que1.empty()) {
		int now = que1.front();
		que1.pop();
		for (int i = 0; i < vec[now].size(); i++) {
			if (l[vec[now][i]] > l[now] + 1) {
				l[vec[now][i]] = l[now] + 1;
				que1.push(vec[now][i]);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << min(r[i], l[i]) << endl;
	}
}