#include <bits/stdc++.h>
using namespace std;
set<long long int> sex;
void primesieve(long long int N, long long int s[]) {
  vector<bool> prime(N + 1, false);
  for (long long int i = 2; i <= N; i += 2) s[i] = 2;
  for (long long int i = 3; i <= N; i += 2) {
    if (prime[i] == false) {
      s[i] = i;
      for (long long int j = i; j * i <= N; j += 2) {
        if (prime[i * j] == false) {
          prime[i * j] = true;
          s[i * j] = i;
        }
      }
    }
  }
}
long long int Primefactor(long long int N) {
  long long int s[N + 1];
  primesieve(N, s);
  long long int curr = s[N];
  long long int cnt = 1;
  long long int maxi = INT_MIN;
  long long int flag = 0;
  while (N > 1) {
    N /= s[N];
    if (curr == s[N]) {
      cnt++;
      continue;
    }
    if (cnt > maxi) {
      maxi = cnt;
    }
    if ((cnt & (cnt - 1)) == 0) {
      flag++;
    }
    curr = s[N];
    sex.insert(cnt);
    cnt = 1;
  }
  return maxi;
}
long long int sieveofE(long long int n) {
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  long long int ans = 1;
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++)
    if (prime[p] && n % p == 0) ans *= p;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  if (n == 1) {
    cout << 1 << " " << 0;
  } else {
    cout << sieveofE(n) << " ";
    long long int res = 0;
    long long int bha = Primefactor(n);
    if (sex.size() == 1) {
      if ((bha & (bha - 1)) != 0) {
        res++;
      }
    } else {
      res++;
    }
    res += ceil(log2(bha));
    cout << res << "\n";
  }
  return 0;
}
