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
import java.util.Scanner;public class WinOrFreeze {	public static void main(String [] args){
		Scanner in = new Scanner(System.in);
		long n = in.nextLong();
		long l = (long)Math.sqrt(n), f=-1 , ff=-1, fn=0,i=l;
		boolean y = false;	a:for (i = 2 ; i <= l; i++){	if(n % i == 0){	n/=i;	fn++;	f = i;	while (n%i==0){n/=i;	fn++;	y=true;}		break a;}}
		for(; i <= l; i++){	while(n % i == 0){	n/=i;	fn++;	ff = i;	}}	fn++;
		if(f == l && fn <=3 )System.out.println("2");
		else if(fn<2)System.out.println("1\n0");
		else if ( fn == 2) System.out.println("2");
		else if ( y) System.out.println("1\n"+(f*f));
		else System.out.println("1\n"+(f*ff));	}}