import java.util.*; import java.io.*; public class Main { static int[] depth; static int[] leaves; static int[] ans; static ArrayList> graph = new ArrayList<>(); public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); } for (int i = 0; i < n - 1; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; graph.get(a).add(b); graph.get(b).add(a); } depth = new int[n]; leaves = new int[n]; getLeaves(0, 0, 0); ans = new int[n]; setAns(0, 0, Integer.MAX_VALUE / 2); StringBuilder sb = new StringBuilder(); for (int x : ans) { sb.append(x).append("\n"); } System.out.print(sb); } static int getLeaves(int idx, int p, int d) { depth[idx] = d; leaves[idx] = Integer.MAX_VALUE; for (int x : graph.get(idx)) { if (x == p) { continue; } leaves[idx] = Math.min(leaves[idx], getLeaves(x, idx, d + 1)); } if (leaves[idx] == Integer.MAX_VALUE) { leaves[idx] = 0; } return leaves[idx] + 1; } static void setAns(int idx, int p, int a) { ans[idx] = Math.min(a, Math.min(depth[idx], leaves[idx])); for (int x : graph.get(idx)) { if (x == p) { continue; } setAns(x, idx, ans[idx] + 1); } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String nextLine() throws Exception { return br.readLine(); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }