#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;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef tuple<int, int, int> TIII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;
	vector<PII> XY(N - 1, MP(0, 0)), YX(N - 1, MP(0, 0));
	vector<bool> isLeaf(N, true);
	REP(i, N - 1){
		int x, y;
		cin >> x >> y;
		x--;
		y--;
		XY[i].first = x;
		XY[i].second = y;
		YX[i].first = y;
		YX[i].second = x;
		isLeaf[x] = false;
	}

	SORT(XY);
	SORT(YX);

	const int MAX = 1e9;
	VI ret1(N, 0), ret2(N, MAX);

	REP(i, N) if(isLeaf[i]) ret2[i] = 0;

	REP(i, N - 1){
		ret1[XY[i].second] = ret1[XY[i].first] + 1;
		ret2[YX[i].second] = min(ret2[YX[i].second], ret2[YX[i].first] + 1);
	}

	REP(i, N) cout << min(ret1[i], ret2[i]) << endl;

	return 0;
}