#include <bits/stdc++.h>
const double PI =
    3.141592653589793238462643383279502884197169399375105820974944;
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<long long> counts;
  long long count = 0, num = 1;
  while (n % 2 == 0) {
    n /= 2;
    ++count;
  }
  if (count) {
    num = num * 2;
    counts.push_back(count);
  }
  count = 0;
  for (long long i = 3; i * i <= n; ++i) {
    count = 0;
    while (n % i == 0) {
      ++count;
      n /= i;
    }
    if (count > 0) {
      num = num * i;
      counts.push_back(count);
    }
  }
  if (n > 2) {
    num = num * n;
    counts.push_back(1);
  }
  long long val = 0;
  for (long long i = 0; i < counts.size(); ++i) {
    val = max(val, (long long)ceil(log2(counts[i])));
  }
  int flag = 0;
  for (long long i = 0; i < counts.size(); ++i) {
    if ((counts[i] & (counts[i] - 1)) != 0 || ceil(log2(counts[i])) != val) {
      ++flag;
      break;
    }
  }
  if (flag) {
    cout << num << " " << val + 1 << endl;
  } else {
    cout << num << " " << val << endl;
  }
}
int main() {
  bool testing = false;
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  if (testing) {
    freopen("test.txt", "rt", stdin);
    int start = clock();
    solve();
    int end = clock();
    cout << "time: " << (end - start) / (double)(CLOCKS_PER_SEC)*1000
         << " milliseconds\n";
  } else {
    solve();
  }
}
