#include <iostream>
#include <vector>
#include <queue>
using namespace std;

const int INF = 1e8;

void dfs(vector<vector<int>>& G, int pos, int last, vector<int>& leaf){
	bool has_child = false;
	for(int i=0; i<G[pos].size(); i++){
		if(G[pos][i] == last) continue;
		dfs(G, G[pos][i], pos, leaf);
		has_child = true;
	}
	if(has_child == false && pos != 0) leaf.push_back(pos);
}

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> leaf;
	dfs(G, 0, -1, leaf);

	vector<int> dist(n, INF);
	queue<pair<int,int>> q;
	q.push({0,0});
	dist[0] = 0;

	for(int i=0; i<leaf.size(); i++){
		q.push({leaf[i], 0});
		dist[leaf[i]] = 0;
	}

	while(q.size()){
		int pos = q.front().first;
		int d = q.front().second;
		q.pop();

		for(int i=0; i<G[pos].size(); i++){
			if(dist[G[pos][i]] > d+1){
				dist[G[pos][i]] = d+1;
				q.push({G[pos][i], d+1});
			}
		}
	}

	for(int i=0; i<n; i++){
		cout << dist[i] << endl;
	}
	return 0;
}