n = read_line.to_i
g = Array.new(n) { [] of Int32 }
(n - 1).times do
  a, b = read_line.split.map(&.to_i)
  g[a - 1] << b - 1
  g[b - 1] << a - 1
end
q = [0]
parent = Array.new(n, -1)
n.times do |i|
  cur = q[i]
  g[cur].each do |adj|
    next if parent[cur] == adj
    parent[adj] = cur
    q << adj
  end
end

f = Array.new(n, 0)
s = Array.new(n, 0)
(n - 1).downto(0) do |i|
  cur = q[i]
  next if cur != 0 && g[cur].size == 1
  s[cur] = n - 1
  par = parent[cur]
  g[cur].each do |adj|
    next if par == adj
    f[cur] = {f[cur], s[adj] + 1}.max
    s[cur] = {s[cur], f[adj] + 1}.min
  end
end
puts f[0]
puts s[0]