import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } long N; void main() { try { for (; ; ) { N = readLong(); long[] ds; for (long d = 1; d * d <= N; ++d) { if (N % d == 0) { ds ~= d; if (d != N / d) { ds ~= N / d; } } } ds.sort; long ans = N - 1; foreach (d; ds) { const lim = cast(long)(sqrt(cast(real)(N / d))) + 10; const pos = ds.upperBound(lim); foreach_reverse (e; ds[0 .. pos]) { if (N / d % e == 0 && e <= N / d / e) { debug { writeln(" ", d, " ", e, " ", N / d / e); } chmin(ans, d + e + N / d / e - 3); break; } } } writeln(ans, " ", N - 1); } } catch (EOFException e) { } }