let N = System.Console.ReadLine() |> int
let graph : (int list) array = Array.create N []

for _ in 0 .. N - 2 do
    let u, v = System.Console.ReadLine().Split() |> Array.map int |> fun a -> a.[0], a.[1]
    let u = u - 1
    let v = v - 1
    graph.[u] <- v :: graph.[u]
    graph.[v] <- u :: graph.[v]

let q = System.Collections.Generic.Queue<int>();

let dist = Array.create N (-1)
dist.[0] <- 0
q.Enqueue(0)

for i = 1 to N - 1 do
    if List.length graph.[i] = 1 then
        dist.[i] <- 0
        q.Enqueue(i)

while q.Count > 0 do
    let u = q.Dequeue()
    for v in graph.[u] do
        if dist.[v] = -1 then
            dist.[v] <- dist.[u] + 1
            q.Enqueue(v)

dist |> Array.iter (fun x -> System.Console.WriteLine(x))