#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = ((ans % m) * (a % m)) % m;
    b /= 2;
    a = ((a % m) * (a % m)) % m;
  }
  return ans % m;
}
const long double eps = 1e-10L;
vector<long long> v, pr;
long long max_pw;
void prime_fac(long long x) {
  long long cnt = 0;
  while (x % 2 == 0) {
    x /= 2;
    cnt++;
  }
  if (cnt > 0) {
    v.push_back(cnt);
    max_pw = max(max_pw, cnt);
    pr.push_back(2);
  }
  cnt = 0;
  for (long long i = 3; i * i <= x; i += 2) {
    cnt = 0;
    while (x % i == 0) {
      x /= i;
      cnt++;
    }
    if (cnt > 0) {
      v.push_back(cnt);
      max_pw = max(max_pw, cnt);
      pr.push_back(i);
    }
  }
  if (x > 1) {
    v.push_back(1);
    pr.push_back(x);
    max_pw = max(max_pw, 1LL);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  if (n == 1) {
    cout << 1 << " " << 0;
    return 0;
  }
  prime_fac(n);
  long long steps = 0;
  long long ans = 1;
  bool fnd = 0;
  long long i, j;
  for (i = 1, j = 1; i; i *= 2, j++) {
    if (i >= max_pw) {
      steps = j;
      break;
    }
  }
  for (long long i = 0; i < pr.size(); i++) ans *= pr[i];
  for (long long i = 0; i < v.size(); i++) {
    if (v[i] != max_pw) fnd = 1;
  }
  if (max_pw == i && (!fnd)) {
    cout << ans << " " << steps - 1 << "\n";
  } else
    cout << ans << " " << steps;
}
