#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n;
	cin>>n;
	vector<vector<ll>> adj(n);
	REP(i,n-1) {
		ll x,y;
		cin>>x>>y;
		--x;
		--y;
		adj[x].pb(y);
		adj[y].pb(x);
	}
	queue<ll> q;
	vector<ll> dir(n,INF);
	q.push(0);
	dir[0]=0;
	REP(i,n) if(i!=0&&(ll)adj[i].size()==1) {
		q.push(i);
		dir[i]=0;
	}
	while(!q.empty()) {
		ll p=q.front();
		q.pop();
		REP(i,(ll)adj[p].size()) {
			if(dir[adj[p][i]]==INF) {
				dir[adj[p][i]]=dir[p]+1;
				q.push(adj[p][i]);
			}
		}
	}
	REP(i,n) cout<<dir[i]<<endl;
}