#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
  for (char& c : s) c = c == ',' ? ' ' : c;
  stringstream ss;
  ss << s;
  vector<string> res;
  for (string z; ss >> z; res.push_back(z))
    ;
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) int idx) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
  if (idx > 0) cerr << ", ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, T...);
}
const double PI = acos(-1);
void solve() {
  long long n;
  cin >> n;
  ;
  map<long long, long long> factors;
  for (long long i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      factors[i]++;
      n /= i;
    }
  }
  if (n > 1) factors[n]++;
  long long ma = 0;
  long long ans1 = 1;
  for (auto ent : factors) {
    ans1 *= ent.first;
    ma = max(ma, ent.second);
  }
  long long needMul = 0;
  if (ma > 1) {
    if (__builtin_popcount(ma) > 1)
      needMul = 1;
    else {
      for (auto ent : factors) {
        if (ent.second != ma) needMul = 1;
      }
    }
  }
  long long ans2 = needMul;
  while (ma > 1) {
    ans2++;
    ma = (ma + 1) / 2;
  }
  cout << ans1 << " " << ans2 << endl;
}
signed main() {
  cin.tie(nullptr);
  std::ios::sync_with_stdio(false);
  solve();
}
