#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int N;
vector<int> es[100000];
int res[100000];

typedef pair<int, int> P;

int main(int argc, char **argv) {
	cin >> N;
	REP(i, N - 1) {
		int x, y;
		cin >> x >> y;
		--x; --y;
		es[x].push_back(y);
		es[y].push_back(x);
		res[i] = 100000;
	}
	res[N - 1] = 100000;
	priority_queue<P> q;
	q.push(MP(0, 0));
	FOR(i, 1, N) if (es[i].size() == 1) q.push(MP(i, 0));
	while (!q.empty()) {
		P p = q.top(); q.pop();
		int v = p.first, d = p.second;
		if (d < res[v]) {
			res[v] = d;
			REP(i, es[v].size()) q.push(MP(es[v][i], d + 1));
		}
	}
	REP(i, N) cout << res[i] << endl;
	return 0;
}