import java.util.*;
import java.io.*;
import java.awt.geom.*;
import java.math.*;

public class No0277 {

	static final Scanner in = new Scanner(System.in);
	static final PrintWriter out = new PrintWriter(System.out,false);

	static void solve() {
		int n = in.nextInt();
		res = new int[n];
		Arrays.fill(res,Integer.MAX_VALUE);
		int[] s = new int[n-1];
		int[] t = new int[n-1];

		for (int i=0; i<n-1; i++) {
			s[i] = in.nextInt()-1;
			t[i] = in.nextInt()-1;
		}

		g = toAdjacencyList(n,s,t);

		rec(0,0,-1);

		for (int i=0; i<n; i++) {
			out.println(res[i]);
		}
	}

	static int[] res;
	static int[][] g;

	static int rec(int cur, int depth, int prev) {
		res[cur] = depth;
		int t = Integer.MAX_VALUE;
		boolean f = false;
		for (int to : g[cur]) {
			if (to == prev) continue;
			f = true;
			t = Math.min(t, rec(to, depth+1, cur) + 1);
		}
		if (!f) return res[cur] = 0;
		res[cur] = Math.min(res[cur],t);
		return t;
	}

	static int[][] toAdjacencyList(int n,int[] from, int[] to) {
		int[] cnt = new int[n];
		for (int i : from) cnt[i]++;
		for (int i : to) cnt[i]++;

		int[][] g = new int[n][];
		for (int i=0; i<n; i++) g[i] = new int[cnt[i]];
		for (int i=0; i<from.length; i++) {
			int f = from[i];
			int t = to[i];
			g[f][--cnt[f]] = t;
			g[t][--cnt[t]] = f;
		}

		return g;
	}

	public static void main(String[] args) {
		long start = System.currentTimeMillis();

		solve();
		out.flush();

		long end = System.currentTimeMillis();
		//trace(end-start + "ms");
		in.close();
		out.close();
	}

	static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}