#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 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,-1);
	queue<int> q;
	ans[0]=0;
	q.push(0);
	rep(i,n)if(edge[i].size()==1){
		q.push(i);
		ans[i]=0;
	}
	while(!q.empty()){
		int u=q.front();q.pop();
		rep(i,edge[u].size()){
			int v=edge[u][i];
			if(ans[v]==-1){
				ans[v]=ans[u]+1;
				q.push(v);
			}
		}
	}
	rep(i,n)cout<<ans[i]<<endl;
	return 0;
}