#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, n, x[3000006], t, w, ans = 1;
vector<int> v;
int main() {
  cin >> n;
  if (n == 1) {
    cout << 1 << " " << 0;
    return 0;
  }
  for (int i = 2; i <= n;) {
    if (n % i == 0) {
      n /= i;
      x[i]++;
      continue;
    }
    i++;
  }
  for (int i = 2; i <= 3000000; i++) {
    if (!x[i]) continue;
    ans *= i;
    int k = log2(x[i]);
    if ((1 << k) != x[i]) {
      x[i] = (1 << (k + 1));
      t = 1;
    }
    v.push_back(x[i]);
    w = max(w, x[i]);
  }
  sort(v.begin(), v.end());
  if (v[0] != v[v.size() - 1]) {
    t = 1;
  }
  cout << ans << " " << t + log2(w);
}
