//木DPっぽい嘘解法
#include <iostream>
#include <vector>
using namespace std;

const int INF = 1e8;

int dfs(vector<vector<int>>& G, vector<int>& dist, int pos, int last, int d){

	int x = INF;
	for(int i=0; i<G[pos].size(); i++){
		if(G[pos][i] == last) continue;
		x = min(x, dfs(G, dist, G[pos][i], pos, d+1) + 1);
	}
	if(x == INF) x = 0;
	dist[pos] = min(x, d);

	return x;
}

int main(){
	int n;
	cin >> n;
	vector<vector<int>> G(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);
	}

	vector<int> dist(n, INF);
	dfs(G,dist, 0,-1,0);
	for(int i=0; i<n; i++){
		cout << dist[i] << endl;
	}
	return 0;
}