#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5005;
int n, fac[MAXN], num;
map<long long, long long> mp;
void solve(int x) {
  num = 0;
  mp.clear();
  for (int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) {
      fac[++num] = i;
      while (x % i == 0) mp[i]++, x /= i;
    }
  }
  if (x != 1) fac[++num] = x, mp[x]++;
}
int main() {
  while (~scanf("%d", &n)) {
    if (n == 1) {
      cout << 1 << " " << 0 << endl;
      continue;
    }
    solve(n);
    long long ans = 1, tnt = 0;
    for (int i = 1; i <= num; i++) {
      ans *= fac[i];
      tnt = max(tnt, mp[fac[i]]);
    }
    cout << ans << " ";
    if (tnt == 1)
      cout << 0 << endl;
    else {
      long long pp = (long long)(1.0 * log2(tnt));
      int flag = 0;
      for (int i = 1; i <= num; i++) {
        if (mp[fac[i]] != (long long)pow(2ll, pp)) {
          flag = 1;
          break;
        }
      }
      if (((long long)pow(2ll, pp) != tnt)) {
        pp++;
      }
      if (flag) pp++;
      cout << pp << endl;
    }
  }
  return 0;
}
