//#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
#include<queue>
using namespace std;
int x;
vector<int>factor;
int dp[1000];
int num[1000];
int main()
{
	while(~scanf("%d",&x))
	{
		factor.clear();
		for(int i=1;i*i<=x;++i)
		{
			if(x % i == 0)
			{
				factor.push_back(i);
				if(x/i != i)
					factor.push_back(x/i);
			}
		}
		sort(factor.begin(),factor.end());
		int SIZE = factor.size();
		int ansnum = 0;
		for(int i=0;i<SIZE;++i)
		{
			dp[i] = 1;
			num[i] = 1;
		}
		for(int i=0;i<SIZE;++i)
		{
			int maxlength = 0;
			for(int j=0;j<i;++j)
			{
				if(factor[i] > factor[j] && factor[i] % factor[j] == 0)
				{
					dp[i] = max(dp[i],dp[j] + 1);
					if(dp[i] > maxlength)
					{
						maxlength = dp[i];
						num[i] = num[j];
					}
					else if(dp[j] + 1 == maxlength)
					{
						num[i] += num[j];
					}
				}
			}
		}
		printf("%d %d\n",dp[SIZE-1]-1,num[SIZE-1]);
	}
	return 0;
}