Problem:
Score : 300 points

Problem Statement

Takahashi is standing on a multiplication table with infinitely many rows and columns.

The square (i,j) contains the integer i \times j. Initially, Takahashi is standing at (1,1).

In one move, he can move from (i,j) to either (i+1,j) or (i,j+1).

Given an integer N, find the minimum number of moves needed to reach a square that contains N.

Constraints

2 \leq N \leq 10^{12}

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the minimum number of moves needed to reach a square that contains the integer N.

Sample Input 1

10

Sample Output 1

5

(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.

Sample Input 2

50

Sample Output 2

13

(5, 10) can be reached in 13 moves.

Sample Input 3

10000000019

Sample Output 3

10000000018

Both input and output may be enormous.

Solution in Scala (2.11.7) (judge verdict: Wrong Answer)

import java.io.{BufferedReader, InputStreamReader}

object Main {
  def main(args: Array[String]): Unit = {
    val n = new BufferedReader(new InputStreamReader(System.in)).readLine().toLong

    System.out.println(
      findAll(n).minBy { case (a, b) =>
        a + b
      } match {
        case (a, b) => a + b - 2
      }
    )
  }

  def toPrimes(n: Long): List[Long] = {
    (2L to Math.sqrt(n).toLong).find(n % _ == 0) match {
      case Some(d) => d :: toPrimes(n / d)
      case None => n :: Nil
    }
  }

  def findAll(n: Long): List[(Long, Long)] = {
    def inner(a: Long, b: Long, primes: List[Long]): List[(Long, Long)] = {
      primes match {
        case prime :: tail =>
          val na = a / prime
          val nb = b * prime
          (a, b) :: inner(na, nb, tail)
        case Nil =>
          Nil
      }
    }

    inner(n, 1L, toPrimes(n))
  }
}