import java.util.Scanner;
import java.lang.Math;
class Main {
    public static void main (String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();
        long i = 10000000000000000L;
        for (long j=1; j<=Math.sqrt((double)n)+1; j++) {
        		if(n%j == 0) {
        			long k = n/j;
        			if (i > (j+k-2)) i = j+k-2;
        		}
        }
        System.out.println(i);
    }
}
/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