8587340257
 9
 81
 27
 1408514752349
 25
 49380563
 266418
 319757451841
 6599669076000
 8
 1000000000000
 30971726
 274875809788
 64
 34280152201
 236
 472670214391
 7938986881993
 44
 4
 388
 2
 802241960524
 3047527844089
 5
 12
 614125
 1716443237161
 48855707
 99
 9999925100701
 5839252225
 3
 50
 1307514188557
 9999926826034
 1468526771489
 2975
 8110708459517
 401120980262
 5138168457911
 1245373417369
 128
 16
 2000000014
 445538663413
 57461344602
 324
 7420738134810

1
9409 2 1
9 1
9 1
72361 2 1
289 1
6 1
289 1
4 1
4 1
4 2 1
4 1
4 2 1
4 1
23020027 1
378028993 1
4 2 1
4 1
0 1
4 2 1
0 1
4 1
25 1
5329 1
2603 1
9 1
0 1
25 1
0 1
10 1
39283 2 1
613783 1
25 2 2 2 1
908209 1
4 1
4 2 1
0 1
6 1
4 1
6
#include <cstdio>
#include <cstring>
#define FORE(it,a) for (it = a.begin(); it != a.end(); it++)
#define FOR(i,start,end) for (i = (start); i < (end); i++)
#define FORR(i,start,end) for (i = (start); i <= (end); i++)
#define RFOR(i,start,end) for (i = (end) - 1; i >= (start); i--)
#define RFORR(i,start,end) for (i = (end); i >= (start); i--)
int j, k, n, m, dn;
__int64 i, p, d[2];
int main()
{
	scanf("%I64d", &p);
	if (p <= 3)
	{
		printf("1\n0\n");
		return 0;
	}
	dn = 0;
	while (dn < 2 && p % 2 == 0)
	{
		d[dn++] = 2;
		p /= 2;
	}
	for (i = 3; dn < 2 && i * i <= p; i += 2)
	{
		while (dn < 2 && p % i == 0)
		{
			d[dn++] = i;
			p /= i;
		}
	}
	if (dn < 2)
	{
		printf(p == 1 ? "1\n0\n" : "2\n");
		return 0;
	}
	if (p == 1)
	{
		printf("2\n");
		return 0;
	}
	printf("1\n%d\n", d[0] * d[1]);
	return 0;
}
