#include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long b,
                 long long mod = (long long)(1e9 + 7)) {
  if (!b) return 1;
  a %= mod;
  return modpow(a * a % mod, b / 2, mod) * (b & 1 ? a : 1) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  int maxim = 0;
  int ans1 = 1;
  set<int> req;
  for (int p = 2; p * p <= n; p++) {
    if (n % p == 0) {
      int cnt = 0;
      while (n % p == 0) {
        cnt++;
        n /= p;
      }
      req.insert(cnt);
      ans1 *= p;
      (maxim) = max((maxim), (cnt));
    }
  }
  if (n > 1) ans1 *= n, (maxim) = max((maxim), (1)), req.insert(1);
  int sec = 1;
  int ans = 0;
  while (sec < maxim) sec *= 2, ans++;
  ans++;
  if (req.size() == 0 || (req.size() == 1 && req.count(sec))) ans--;
  cout << ans1 << " " << ans << endl;
  return 0;
}
