class Integer
  def divisor_list
    require 'prime'

    return [] if self <= 0
    return [1] if self == 1

    prime_division.map.with_index { |(base, k), i|
      s = i.zero? ? 0 : 1 
      (s..k).map { |n| base ** n } 
    }.inject { |res, e| res + res.flat_map { |t| e.map { |v| t * v } } }.sort
  end 
end

N = gets.to_i


min_t = Float::INFINITY
max_t = N - 1

N.divisor_list.repeated_combination(3).each do |a, b, c|
  next if a * b * c != N

  t = (a - 1) + (b - 1) + (c - 1)
  min_t = t if min_t > t
end

puts [min_t, max_t].join(' ')