#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];
int from[100050];
int to[100050];
bool leaf[100050];


int main(){
	int n;
	queue<int> q;
	cin >> n;
	
	//初期化
	for(int i=1; i<=n; i++){
		kyori[i] = INT_MAX / 2;
		leaf[i] = true;
	}
	kyori[1] = 0;
	q.push(1);
	
	rep(i,n-1){
		cin >> from[i] >> to[i];
		leaf[from[i]] = false;
	}
	
	for(int i=1; i<=n; i++){
		if(leaf[i]){
			kyori[i] = 0;
			q.push(i);
		}
	}
	
	while(!q.empty()){
		for(int i=0; i<n-1; i++){
			if(to[i] == q.front()){
				if(kyori[from[i]] > kyori[ q.front() ] + 1){
					kyori[from[i]] = kyori[ q.front() ] + 1;
					q.push(from[i]);
				}
			}
			if(from[i] == q.front()){
				if(kyori[to[i]] > kyori[ q.front() ] + 1){
					kyori[to[i]] = kyori[ q.front() ] + 1;
					q.push(to[i]);
				}
			}
		}
		q.pop();
	}
	
	for(int i=1; i<=n; i++){
		cout << kyori[i] << endl;
	}
	
    return 0;
}