#include <bits/stdc++.h>
using namespace std;
long long arr[1000003];
void primeFactors(long long n) {
  while (n % 2 == 0) {
    arr[2]++;
    n = n / 2;
  }
  for (long long i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      arr[i]++;
      n = n / i;
    }
  }
  if (n > 2) arr[n]++;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  long long ans = 1;
  arr[1] = 1;
  primeFactors(n);
  long long maxi = 0;
  for (long long i = 1; i <= n; i++) {
    if (arr[i]) ans *= i;
    if (arr[i] > maxi) maxi = arr[i];
  }
  if (maxi == 1) {
    cout << ans << " "
         << "0";
    return 0;
  }
  long long ans1 = log2(maxi);
  if (pow(2, ans1) != maxi) ans1++;
  long long temp = ans;
  for (long long i = 1; i <= 25; i++) {
    if (temp == n) {
      cout << ans << " " << ans1;
      return 0;
    }
    if (temp <= 1000000)
      temp = temp * temp;
    else
      break;
  }
  cout << ans << " " << ans1 + 1;
}
