#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
	int N;
	cin >> N;
	vector<vector<int>> E(N);
	for (int i = 0; i < N - 1; i++){
		int x, y;
		cin >> x >> y;
		x--;
		y--;
		E[x].push_back(y);
		E[y].push_back(x);
	}
	vector<int> d(N, -1);
	queue<int> Q;
	d[0] = 0;
	Q.push(0);
	for (int i = 1; i < N; i++){
		if (E[i].size() == 1){
			d[i] = 0;
			Q.push(i);
		}
	}
	while (!Q.empty()){
		int v = Q.front();
		Q.pop();
		for (int w : E[v]){
			if (d[w] == -1){
				d[w] = d[v] + 1;
				Q.push(w);
			}
		}
	}
	for (int i = 0; i < N; i++){
		cout << d[i] << endl;
	}
}