#include <cstdio>

#include <cmath>

#include <iostream>

using namespace std;

typedef long long LL;

int p[22], a[22];

int cnt;

int main() {

	int n, i, j;

	while (scanf("%d", &n) != EOF) {

		cnt = 0;

		for (i = 2; i <= sqrt(n); ++i) { // 质因子分解

			if (n % i == 0) {

				p[cnt] = i;

				n /= i;

				a[cnt++] = 1;

			}

			while (n % i == 0) {

				a[cnt - 1]++;

				n /= i;

			}

		}

		if (n > 1) { // 注意点，容易忘记

			p[cnt] = n;

			a[cnt++] = 1;

		}

		LL ans = 1;

		int A = 0;

		for (i = 0; i < cnt; ++i) {

			A += a[i];

		}

		for (i = a[0] + 1; i <= A; ++i) { // 提前除以a[0]!

			ans *= i;

		}

		for (i = 1; i < cnt; ++i) {

			for (j = 2; j <= a[i]; ++j) {

				ans /= j;

			}

		}

		printf("%d %lld\n", A, ans);

	}

	return 0;

}