#include <stdio.h>

#define MAX 100000

int calc(int, int);

int last[MAX], vertex[MAX * 3], next[MAX * 3], ptr, visited[MAX], ans[MAX];

int main(void) {
	int n, i;
	scanf("%d", &n);
	
	for(i = 0; i < n; i++) {
		last[i] = i;
		ptr++;
	}
	
	for(i = 0; i < n - 1; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		x--; y--;
		vertex[ptr] = y; next[ptr] = -1; next[ last[x] ] = ptr; last[x] = ptr; ptr++;
		vertex[ptr] = x; next[ptr] = -1; next[ last[y] ] = ptr; last[y] = ptr; ptr++;
	}
	
	calc(0, 0);
	
	for(i = 0; i < n; i++) {
		printf("%d\n", ans[i]);
	}
	
	return 0;
}

int calc(int v, int c) {
	visited[v] = 1;
	
	int m = MAX;
	int p = next[v];
	while(p != -1) {
		if(visited[ vertex[p] ] == 0) {
			int temp = calc(vertex[p], c + 1) + 1;
			m = (temp < m ? temp : m); 
		}
		p = next[p];
	}
	m = (m == MAX ? 0 : m);
	ans[v] = (c < m ? c : m);
	return m;
}