#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<random>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


int ans[100000];
int n;
vector<int> edge[100000];

int dfs1(int u,int par,int mind){
	if(u!=0 && edge[u].size()==1)return ans[u]=0;
	rep(i,edge[u].size()){
		if(par==edge[u][i])continue;
		mind=min(mind,dfs1(edge[u][i],u,mind+1)+1);
	}
	return ans[u]=min(ans[u],mind);
}
int dfs2(int u,int par,int mind){
	if(u!=0 && edge[u].size()==1)return ans[u]=0;
	for(int i=edge[u].size()-1;i>=0;i--){
		if(par==edge[u][i])continue;
		mind=min(mind,dfs1(edge[u][i],u,mind+1)+1);
	}
	return ans[u]=min(ans[u],mind);
}

int main() {
	cin>>n;
	rep(u,n-1){
		int x,y;
		cin>>x>>y;
		x--;y--;
		edge[x].push_back(y);
		edge[y].push_back(x);
	}
	fill_n(ans,n,INF);
	dfs1(0,-1,0);
	dfs2(0,-1,0);
	rep(i,n)cout<<ans[i]<<endl;
	return 0;
}