#include <stdio.h>
#include <stdlib.h>
// (2^3)^14 < 10^14 < (2^4)^14
long long P[4*14];
int E[4*14];
int Pend = 0;
int factor(long long N)
{
  long long p;
  int e;
  p=2;
  if (N%p == 0) {
    P[Pend] = p;
    e=1;
    for (N/=p; N%p==0; N/=p) e++;
    E[Pend] = e;
    Pend++;
  }
  for (p=3; p*p<=N; p+=2) {
    if (N%p == 0) {
      P[Pend] = p;
      e=1;
      for (N/=p; N%p==0; N/=p) e++;
      E[Pend] = e;
      Pend++;
    }
  }
  if (N != 1) {
    P[Pend] = N;
    E[Pend] = 1;
    Pend++;
  }
  return 0;
}
long long pwr(long long d, int e)
{
  long long dd = 1;
  if (e == 0) {
  } else {
    int i;
    for (i=1; i<=e; i++) dd*=d;
  }
  return dd;
}
int cmpr(const void *a, const void *b)
{
  if (*(long long *)a < *(long long *)b) {
    return -1;
  } else if (*(long long *)a > *(long long *)b) {
    return 1;
  } else {
    return 0;
  }
}
int main()
{
  long long N;
  scanf("%lld", &N);
  factor(N);

  int i;
  long long *D;
  int Dsz = 1;
  for (i=0; i<Pend; i++) Dsz *= (E[i]+1);
  D = (long long *)malloc(sizeof(long long)*Dsz);
  for (i=0; i<Dsz; i++) D[i] = 1;

  int j,k,l;
  int rpt = 1;
  for (i=0; i<Pend; i++) {
    for (j=0, k=0; j<Dsz; ) {
      for (l=0; l<rpt; l++) {
        D[j] *= pwr(P[i],k);
        j++;
      }
      k++;
      k %= (E[i]+1);
    }
    rpt *= (E[i]+1);
  }
  qsort(D, Dsz, sizeof(long long), cmpr);

  long long N2;
  long long a,b,c;
  long long min = N-1;
  i = 0;
  for (a=D[i]; (a<=100000) && (a*a*a<=N); a=D[i]) {
    N2 = N/a;
    j = 0;
    for (b=D[j]; (b<=10000000) && (b*b<=N2); b=D[j]) {
      if (N2%b == 0) {
        c = N2/b;
        if (min > (a+b+c-3)) min = a+b+c-3;
      }
      j++;
    }
    i++;
  }
  printf("%lld %lld\n", min, N-1);
  return 0;
}