#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> g[100000];
int r[100000], l[100000];

void dfs(int v, int p)
{
	for (int t : g[v]){
		if (t != p){
			r[t] = r[v] + 1;
			dfs(t, v);
			l[v] = l[t] + 1;
		}
	}
}

int main()
{
	cin >> n;
	for (int i = 0; i < n - 1; i++){
		int x, y;
		cin >> x >> y;
		x--; y--;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	
	dfs(0, -1);
	
	for (int i = 0; i < n; i++){
		cout << min(r[i], l[i]) << endl;
	}
}