#include <bits/stdc++.h>
using namespace std;
long long maxi = LLONG_MIN;
long long mini = LLONG_MAX;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
long long t, i, j, k, n, temp, flag, ans, m;
long long check(long long n) {
  if (n == 1 || n == 2 || n == 4 || n == 8 || n == 16 || n == 32)
    return 1;
  else
    return 0;
}
int main() {
  cin >> n;
  long long steps = 0;
  long long num = 1;
  i = 1;
  vector<pair<long long, long long> > ans;
  ans.push_back(make_pair(n, 0));
  vector<long long> v;
  while (n > 1) {
    i++;
    if (n % i == 0) {
      long long c = 0;
      while (n % i == 0) {
        c++;
        n /= i;
      }
      num *= i;
      v.push_back(c);
      maxi = max(maxi, c);
    }
  }
  for (i = 0; i < v.size(); i++) {
    if (flag == 0 && v[i] != maxi) {
      steps++;
      flag = 1;
    }
  }
  if (check(maxi)) {
    while (maxi > 1) {
      steps++;
      maxi /= 2;
    }
  } else {
    if (flag != 1) steps++;
    while (maxi > 1) {
      steps++;
      maxi /= 2;
    }
    steps++;
  }
  ans.push_back(make_pair(num, steps));
  sort(ans.begin(), ans.end());
  cout << ans[0].first << ' ' << ans[0].second << '\n';
  return 0;
}
