#include <bits/stdc++.h>
using namespace std;
vector<int> prime;
const int mx = 1000003;
int prime_checker[1000005];
set<int> factor, element;
int mx1 = INT_MIN;
void prime_finder() {
  for (int i = 4; i <= mx; i += 2) prime_checker[i] = 1;
  for (int i = 3; i * i <= mx; i++) {
    if (prime_checker[i] == 0) {
      for (int j = i * i; j <= mx; j += 2 * i) {
        prime_checker[j] = 1;
      }
    }
  }
  for (int i = 2; i <= mx; i++) {
    if (prime_checker[i] == 0) prime.push_back(i);
  }
}
void prime_factorizer(int n) {
  int sqrtn = sqrt(n);
  for (int i = 0; i < prime.size() && prime[i] <= sqrtn; i++) {
    if (n % prime[i] == 0) {
      int cnt = 0;
      while (n % prime[i] == 0) {
        cnt++;
        n /= prime[i];
      }
      factor.insert(cnt);
      mx1 = max(cnt, mx1);
      element.insert(prime[i]);
      sqrtn = sqrt(n);
    }
  }
  if (n != 1) {
    factor.insert(1);
    mx1 = max(mx1, 1);
    element.insert(n);
  }
}
int main() {
  prime_finder();
  int n;
  cin >> n;
  if (n == 1) {
    cout << 1 << " 0" << endl;
    return 0;
  }
  prime_factorizer(n);
  int flag = 0, no_need = 0, need = 0;
  long long int mul = 1;
  for (auto it : element) {
    mul *= it;
  }
  if (factor.size() == 1) {
    flag = 1;
  }
  if (mx1 == 1) {
    cout << mul << " " << 0 << endl;
    return 0;
  }
  for (int i = 1;; i++) {
    int l1 = pow(2, i);
    if (l1 == mx1) {
      no_need = i;
      break;
    }
    if (l1 > mx1) {
      need = i + 1;
      break;
    }
  }
  if (flag == 1 && no_need != 0) {
    cout << mul << " " << no_need << endl;
  } else if (flag == 0 && no_need != 0) {
    cout << mul << " " << no_need + 1 << endl;
  } else
    cout << mul << " " << need << endl;
}
