#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};
const int modd = 1000000007;

int kyori[100050];
vector<int> node[100050];

int main(){
	int n;
	int in1,in2;
	int op;
	queue<int> q;
	
	cin >> n;
	
	//初期化
	for(int i=1; i<=n; i++){
		kyori[i] = INT_MAX * 0.99;
	}
	kyori[1] = 0;
	q.push(1);
	
	rep(i,n-1){
		cin >> in1 >> in2;
		node[in1].push_back(in2);
		node[in2].push_back(in1);
	}
	
	for(int i=1; i<=n; i++){
		if(node[i].size() == 1){
			kyori[i] = 0;
			q.push(i);
		}
	}
	
	while(!q.empty()){
		for(int i=0; i<node[ q.front() ].size(); i++){
			op = node[q.front()][i];
			if(kyori[op] > kyori[ q.front() ] + 1){
				kyori[op] = kyori[ q.front() ] + 1;
				q.push(op);
			}
		}
		q.pop();
	}
	
	for(int i=1; i<=n; i++){
		cout << kyori[i] << endl;
	}
	
    return 0;
}