#include <stdio.h>

typedef struct Edge {
	struct Edge *next;
	int v;
} edge;

int main()
{
	int i, N, u, w;
	edge *adj[100001] = {}, e[200001], *p;
	scanf("%d", &N);
	for (i = 0; i < N - 1; i++) {
		scanf("%d %d", &u, &w);
		e[i*2].v = w;
		e[i*2+1].v = u;
		e[i*2].next = adj[u];
		e[i*2+1].next = adj[w];
		adj[u] = &(e[i*2]);
		adj[w] = &(e[i*2+1]);
	}
	
	int par[100001] = {}, ans[100001], q[100001], head, tail;
	par[1] = 1;
	ans[1] = 0;
	q[0] = 1;
	for (head = 0, tail = 1; head < tail; head++) {
		u = q[head];
		for (p = adj[u]; p != NULL; p = p->next) {
			w = p->v;
			if (par[w] == 0) {
				par[w] = u;
				q[tail++] = w;
				if (u > w) ans[1]++;
			}
		}
	}
	for (head = 1; head < tail; head++) {
		u = q[head];
		ans[u] = ans[par[u]];
		if (u > par[u]) ans[u]++;
		else ans[u]--;
	}
	for (u = 1; u <= N; u++) printf("%d\n", ans[u]);
	fflush(stdout);
	return 0;
}