#include <bits/stdc++.h>
using namespace std;
int a[10000001];
map<long long, bool> m;
int go(long long k) {
  int c = 0;
  int cnt = 1;
  while (cnt != k) {
    cnt *= 2;
    c += 1;
  }
  return c;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  if (n == 1) {
    cout << 1 << ' ' << 0 << '\n';
    return 0;
  }
  int ans = 0;
  int Max = 0;
  long long cnt = 1;
  long long temp = n;
  for (int i = 1; i <= 1000000; i *= 2) {
    m[i] = true;
  }
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      cnt *= i;
    }
    while (n % i == 0) {
      a[i] += 1;
      n /= i;
      Max = max(a[i], Max);
    }
  }
  if (n > 1) {
    a[n] = 1;
    cnt *= n;
    Max = max(a[n], Max);
  }
  bool flag = false;
  for (int i = 2; i <= temp; i++) {
    if (a[i] > 0 && a[i] != Max) {
      flag = true;
      break;
    }
  }
  if (m[Max]) {
    if (!flag) {
      cout << cnt << ' ' << go(Max) << '\n';
      return 0;
    } else {
      cout << cnt << ' ' << go(Max) + 1 << '\n';
      return 0;
    }
  }
  int K = 1;
  while (K < Max) {
    K *= 2;
  }
  cout << cnt << ' ' << go(K) + 1 << '\n';
  return 0;
}
