import java.util.Scanner;

public class Main {
  public static void main (String[] args) {
    Scanner in = new Scanner(System.in);

    while (in.hasNext()) {
      long N = in.nextLong();
      long ceilSqrtN = ceilSqrt(N);
      long minMove = 0;

      for (long i = ceilSqrtN; i > 0; --i) {
        if (N % i == 0) {
          minMove = (i - 1) + (N / i) - 1;
          break;
        }
      }

      System.out.println(minMove);
    }
  }

  private static long ceilSqrt (long N) {
    long sqrtN = 1;

    while (sqrtN * sqrtN <= N) {
      ++sqrtN;
    }

    return sqrtN - 1;
  }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz