#include <bits/stdc++.h>
using namespace std;
map<long long int, long long int> m;
void primeFactors(long long int n) {
  while (n % 2 == 0) {
    m[2]++;
    n = n / 2;
  }
  for (long long int i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      m[i]++;
      n = n / i;
    }
  }
  if (n > 2) m[n]++;
}
long long int dp[1000];
long long int fun(vector<long long int> &v) {
  long long int c = 0;
  long long int n = v.size();
  for (long long int i = 0; i < n; i++) {
    if (v[i] != 1) c = 1;
  }
  if (c == 0) return 0;
  c = 0;
  map<long long int, long long int> mm;
  for (long long int i = 0; i < n; i++) {
    mm[v[i]]++;
  }
  if (mm.size() > 1) c = 1;
  long long int ma = 0;
  for (long long int i = 0; i < n; i++) ma = max(ma, v[i]);
  long long int ans = 0;
  while (ma > 1) {
    if (ma % 2 != 0) c = 1;
    ma = (ma + 1) / 2;
    ans++;
  }
  return ans + c;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> v;
  vector<long long int> v1;
  primeFactors(n);
  for (auto it : m) {
    v.push_back(it.first);
    v1.push_back(it.second);
  }
  long long int val = 1;
  memset(dp, -1, sizeof(dp));
  long long int ans = fun(v1);
  for (auto it : v) {
    val *= it;
  }
  cout << val << " " << ans;
}
