#include <bits/stdc++.h>
using namespace std;
map<long long, long long> cnt;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  long long k = n;
  long long ans = 1;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      ans *= i;
      while (n % i == 0) {
        n /= i;
        cnt[i]++;
      }
    }
  }
  if (n >= 2) {
    ans *= n;
    cnt[n]++;
    if (k == n) {
      cout << ans << " " << 0;
      return 0;
    }
  }
  long long ans2 = 0;
  long long num = cnt.size();
  for (auto it : cnt) {
    long long x = it.second;
    long long num = ceil(log2(x));
    ans2 = max(ans2, num);
  }
  long long y = (cnt.begin())->second;
  for (auto it : cnt) {
    if (it.second != y || it.second != pow(2, ans2)) {
      ans2++;
      break;
    }
  }
  cout << ans << " " << ans2;
}
