import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	private int[] R, L;
	private ArrayList<ArrayList<Integer>> graph;

	public void solve() {
		FastScanner scanner = new FastScanner();
		int N = (int) scanner.nextLong();
		graph = new ArrayList<>();
		for (int i = 0; i < N; i++) {
			graph.add(new ArrayList<Integer>());
		}

		for (int i = 0; i < N - 1; i++) {
			int from = (int) scanner.nextLong() - 1;
			int to = (int) scanner.nextLong() - 1;
			graph.get(from).add(to);
			graph.get(to).add(from);
		}
		R = new int[N];
		Arrays.fill(R, N * 2);
		L = new int[N];
		Arrays.fill(L, N * 2);
		R[0] = dfs(0, -1, 0);

		StringBuilder builder = new StringBuilder();
		for (int i = 0; i < N; i++) {
			builder.append(Math.min(L[i], R[i]) + "\n");
		}
		System.out.print(builder.toString());
	}

	private int dfs(int now, int parent, int dist) {
		L[now] = dist;
		if (graph.get(now).size() == 1 && now != 0) {
			return 0;
		}

		int fromLeaf = Integer.MAX_VALUE;
		for (int next : graph.get(now)) {
			if (next != parent) {
				R[next] = Math.min(R[next], dfs(next, now, dist + 1));
				fromLeaf = Math.min(R[next], fromLeaf);
			}
		}
		return fromLeaf + 1;
	}

	public static void main(String[] args) {
		new Main().solve();
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
}