#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;

int N;
vector<int> G[101010];
int dist[101010];

int main() {
    cin >> N;
    rep (i, N - 1) {
        int x, y;
        cin >> x >> y;
        x--; y--;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    const int inf = 1e9;
    rep (i, N) dist[i] = inf;
    queue<int> q;
    rep (i, N) {
    	if (i == 0 || G[i].size() == 1) {
    		q.push(i);
    		dist[i] = 0;	
    	}
    }
    while (!q.empty()) {
    	int curr = q.front(); q.pop();
    	for (int next : G[curr]) {
    		if (dist[next] > dist[curr] + 1) {
    			dist[next] = dist[curr] + 1;
    			q.push(next);
    		}
    	}
    }
    rep (i, N) {
    	cout << dist[i] << endl;
    }

    return 0;
}