#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;
	cin >> n;
	
	//初期化
	for(int i=1; i<=n; i++){
		leaf[i] = true;
	}
	kyori[1] = 0;
	
	rep(i,n-1){
		cin >> from[i] >> to[i];
		leaf[from[i]] = false;
		kyori[to[i]] = kyori[from[i]] + 1;
	}
	
	for(int i=n-2; i>=0; i--){
		if(leaf[ to[i] ]){
			kyori[ to[i] ] = 0;
		}
		
		kyori[ from[i] ] = min(kyori[ from[i] ], kyori[ to[i] ] + 1);
	}
	
	for(int i=1; i<=n; i++){
		cout << kyori[i] << endl;
	}
	
    return 0;
}