require 'prime'
N = gets.to_i

primes = Prime.prime_division(N).map{|a,b|[a]*b}.flatten
a, b = 1,1
sum =[1]
dp = Array.new(primes.size + 1){ {} }
dp[0][0] = [1,1]
primes.each_with_index do |prime, i|
  sum[i+1] = sum[i] * prime
  (i+2).times do |j|
    if j == 0
      dp[i+1][j] = [dp[i][j][0], dp[i][j][1] * prime]
    elsif !dp[i][j]
      dp[i+1][j] = [dp[i][j-1][0]*prime, dp[i][j-1][1]]
    else
      if (dp[i][j][0] + dp[i][j][1] * prime) < (dp[i][j-1][0] *prime + dp[i][j-1][1])
        dp[i+1][j] = [dp[i][j][0], dp[i][j][1] * prime]
      else
        dp[i+1][j] = [dp[i][j-1][0]*prime, dp[i][j-1][1]]
      end
    end
  end
end
res = dp[-1].values.map{|a| a[0]+a[1]}.min
puts res - 2