#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, ans = 1;
  cin >> n;
  long long nn = n, c = 0, c2 = 0;
  std::map<long long, long long> m;
  if (n % 2 == 0) {
    ans *= 2;
    c++;
    while (n % 2 == 0) {
      n /= 2;
      c2++;
    }
    m[2] = c2;
  }
  for (long long i = 3; i * i <= n; i += 2) {
    if (n % i == 0) {
      ans *= i;
      c++;
      long long w = 0;
      while (n % i == 0) {
        n /= i;
        c2++;
        w++;
      }
      m[i] = w;
    }
  }
  if (n > 1) {
    ans *= n;
    c++;
    c2++;
    m[n] = 1;
  }
  long long ma = 0, tw, mi = (1 << 30);
  std::vector<long long> v;
  set<long long> s;
  for (auto x : m) {
    ma = max(ma, x.second);
    mi = min(mi, x.second);
    if (ma == x.second) tw = x.first;
    v.push_back(x.second);
    s.insert(x.second);
  }
  if (c == c2) {
    cout << ans << " " << 0 << '\n';
    return 0;
  }
  long long cnt = 0, jj;
  for (long long i = 0; i < 20; i++) {
    jj = pow(2, i);
    if (jj > ma) {
      cnt = i + 1;
      break;
    } else if (jj == ma) {
      if (s.size() == 1)
        cnt = i;
      else
        cnt = i + 1;
      break;
    }
  }
  cout << ans << " " << cnt << endl;
  return 0;
}
