#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int prime[maxn];
struct node {
  int P;
  int num;
} a[maxn];
int j;
void init(int n) {
  for (int i = 2; i * i <= maxn; i++) {
    int cnt = 0;
    bool flag = 0;
    while (n % i == 0 && n != 1) {
      if (flag == 0) j++;
      flag = 1;
      a[j].P = i;
      a[j].num++;
      n /= i;
    }
    if (n == 1) {
      break;
    }
  }
}
bool check(int n) {
  while (n % 2 == 0) {
    n = n / 2;
    if (n == 1) return true;
  }
  return false;
}
int main() {
  int n = 0;
  while (~scanf("%d", &n)) {
    init(n);
    int ans1 = 1, ans2;
    int Max = 0;
    for (int i = 1; i <= j; i++) {
      Max = max(Max, a[i].num);
      ans1 = a[i].P * ans1;
    }
    int tmp = Max;
    int cnt = 0;
    if (Max == 0) {
      printf("%d 0\n", n);
      return 0;
    }
    while (tmp != 1 && tmp % 2 == 0) {
      tmp /= 2;
      cnt++;
    }
    if (tmp != 1) {
      while (!check(tmp)) {
        tmp++;
      }
      Max = cnt != 0 ? cnt * 2 * tmp : tmp;
    }
    int sum = 0;
    for (int i = 1; i <= j; i++) {
      if (Max != a[i].num) {
        sum = 1;
        break;
      }
    }
    int cnt2 = 0;
    while (Max != 1) {
      Max = Max / 2;
      cnt2++;
    }
    ans2 = cnt2 + sum;
    if (ans2 == 0) {
      ans1 = n;
    }
    printf("%d %d\n", ans1, ans2);
  }
}
