#include <iostream>
#include <vector>
#include <queue>
#include <cassert>

using namespace std;
int main(){
	int n;
	cin >> n;
	assert(2<=n && n<=100000);

	vector<vector<int>> G(n);
	for(int i=0; i<n-1; i++){
		int x,y;
		cin >> x >> y;
		assert(1<=x);
		assert(x< y);
		assert(y<=n);

		x--; y--;
		G[x].push_back(y);
		G[y].push_back(x);
	}

	vector<int> dist(n, 1e8);

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

	while(q.size()){
		int pos = q.front();
		q.pop();
		for(int to : G[pos]){
			if(dist[to] > dist[pos]+1){
				dist[to] = dist[pos]+1;
				q.push(to);
			}
		}
	}

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