using System; using System.Collections; using System.Collections.Generic; using System.Collections.Specialized; using System.Text; using System.Text.RegularExpressions; using System.Linq; using System.IO; class Program { static void Main(string[] args) { Magatro alice = new Magatro(); alice.Scan(); alice.Solve(); } } public class Scanner { private StreamReader Sr; private string[] S; private int Index; private const char Separator = ' '; public Scanner() { Index = 0; S = new string[0]; Sr = new StreamReader(Console.OpenStandardInput()); } private string[] Line() { return Sr.ReadLine().Split(Separator); } public string Next() { string result; if (Index >= S.Length) { S = Line(); Index = 0; } result = S[Index]; Index++; return result; } public int NextInt() { return int.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } public string[] StringArray(int index = 0) { Next(); Index = S.Length; return S.Skip(index).ToArray(); } public int[] IntArray(int index = 0) { return StringArray(index).Select(int.Parse).ToArray(); } public long[] LongArray(int index = 0) { return StringArray(index).Select(long.Parse).ToArray(); } public bool EndOfStream { get { return Sr.EndOfStream; } } } public class Magatro { private long N; private List L; public void Scan() { Scanner sc = new Scanner(); N = sc.NextLong(); } public void Solve() { long Tmin = long.MaxValue; L = new List(); Calc(); long max = (long)Math.Pow(N, 1.0 / 3); int i; int j; for (i = 0; L[i] <= max; i++) { for (j = 0; L[j] <= max; j++) { if ((N / L[i]) % L[j] == 0) { long k = N / L[i] / L[j]; Tmin = Math.Min(Tmin, (L[i] - 1) + (L[j] - 1) + (k - 1)); } } if ((N / L[i]) % L[j] == 0) { long k = N / L[i] / L[j]; Tmin = Math.Min(Tmin, (L[i] - 1) + (L[j] - 1) + (k - 1)); } } for (j = 0; L[j] <= max; j++) { if ((N / L[i]) % L[j] == 0) { long k = N / L[i] / L[j]; Tmin = Math.Min(Tmin, (L[i] - 1) + (L[j] - 1) + (k - 1)); } } if ((N / L[i]) % L[j] == 0) { long k = N / L[i] / L[j]; Tmin = Math.Min(Tmin, (L[i] - 1) + (L[j] - 1) + (k - 1)); } long Tmax = N - 1; Console.WriteLine("{0} {1}", Tmin, Tmax); } private void Calc() { long loop = (long)Math.Sqrt(N); for (long i = 1; i <= loop; i++) { if (N % i == 0) { L.Add(i); if (i * i != N) { L.Add(N / i); } } } L.Sort(); } }