# Here your code !
INF = 10 ** 8
n = gets.to_i
P = Array.new(n+1,1); P[0] = 1; 
R = Array.new(n+1,INF); R[0] = 0; R[1] = 0
L = Array.new(n+1,INF); L[0] = 0;

E = (n - 1).times.map { from, to = gets.split.map(&:to_i) }.group_by {|from,to| from }
(1..n).each do |from|
    if E[from]
        E[from].each do |(_,to)|
            P[to] = from
            R[to] = R[from] + 1
        end
    end
end

leaf = (1..n).reject {|v| E[v] }
leaf.each do |i|
    d = R[i] + 1
    d.times.inject(i) do |j, dep|
        L[j] = [L[j], dep].min
        P[j]
    end
end

(1..n).each do |i|
  L[i] = [ L[i], L[P[i]] + 1].min
end

puts (1..n).map {|i| [R[i], L[i]].min }