#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
long long int M = 1e9 + 7;
long long int MOD = 998244353;
const double PI = 3.141592653589793238460;
bitset<N> bs;
long long int power(long long int a, long long int b) {
  long long int res = 1;
  if (a == 0) return 0;
  if (a == 1) return 1;
  for (; b > 0; b >>= 1) {
    if (b & 1) {
      res = (res * a);
      if (res > M) res %= M;
    }
    a = (a * a);
    if (a > M) a = a % M;
  }
  return res;
}
int main() {
  long long int n;
  cin >> n;
  long long int t = n;
  map<long long int, long long int> m;
  for (long long int i = 2; i * i <= t; i++) {
    if (t % i == 0) {
      while (t % i == 0) {
        t /= i;
        m[i]++;
      }
    }
  }
  if (t > 1) {
    m[t] = 1;
  }
  long long int pr = 1;
  long long int cnt = 0;
  bool flag = false;
  long long int maxi = 1;
  for (auto it : m) {
    long long int x = it.second;
    maxi = max(maxi, x);
    if (!(x & (x - 1)))
      continue;
    else {
      flag = 1;
      long long int time = 0;
      while (x) {
        x /= 2;
        time++;
      }
      maxi = max(maxi, (1ll << time));
      m[it.first] = (1ll << time);
    }
  }
  for (auto it : m) {
    if (it.second != maxi) {
      flag = 1;
      break;
    }
  }
  cnt += (flag == 1);
  for (auto it : m) pr *= (it.first);
  long long int time = log2(maxi);
  cnt += time;
  cout << pr << " " << cnt;
}
