#include <bits/stdc++.h>
using namespace std;
using lli = long long;
using ld = long double;
mt19937 rnd(time(nullptr));
const lli LG = 60;
lli GetIndex(lli mask) {
  for (lli i = LG - 1; i >= 0; i--)
    if ((mask >> i) & 1) return i;
  assert(false);
}
inline void Solve() {
  lli n = 0;
  cin >> n;
  vector<pair<lli, lli>> fact;
  for (lli i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      fact.push_back({i, 0});
      while (n % i == 0) {
        fact.back().second++;
        n /= i;
      }
    }
  }
  if (n > 1) fact.push_back({n, 1});
  lli counter = 0, result = 1;
  for (auto it : fact) result *= it.first;
  while (true) {
    bool flag = true;
    for (auto &it : fact) {
      if (it.second != 1) {
        flag = false;
        break;
      }
    }
    if (flag) break;
    lli current = 0;
    for (auto &it : fact) {
      if (it.second % 2 != 0) current++;
    }
    if (current == 0) {
      counter++;
      for (auto &it : fact) it.second /= 2;
    } else {
      counter++;
      lli mx = 0;
      for (auto &it : fact) mx = max(mx, it.second);
      lli id = GetIndex(mx);
      if ((1LL << id) == mx)
        mx = (1LL << id);
      else
        mx = (1LL << (id + 1));
      for (auto &it : fact) {
        it.second = mx;
      }
    }
  }
  cout << result << ' ' << counter;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cout << fixed << setprecision(20);
  Solve();
  return 0;
}
