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.*;
import java.math.*;
import java.io.*;

public class Main
	{
	public static void main(String args[]) throws IOException
		{
		Scanner c=new Scanner(System.in);
		long N=c.nextLong();
		int MAX=100000;
		int A[]=new int[MAX];		//10M
		int len=primeL(N);
		if(len==1)
			{
			System.out.println(1);
			System.out.println(0);
			return;
			}
		if(len==2)			//product of 2 primes
			{
			System.out.println(2);
			return;
			}
		else
			{
			int P[]=primeA(N);
			//System.out.println("prime array: "+Arrays.toString(P));
			System.out.println(1);
			System.out.println(P[0]*P[1]);
			}
		}
	
	public static int primeL(long N)
		{
		if(N==1)
			return 1;
		int len = 0;
		for (long i = 2; i * i <= N; i++)
			{
			while (N % i == 0)
				{
				N = N / i;
				len++;
				}
			}
		if (N > 1) //a residue prime number
			len++;
		return len;
		}
	
	public static int[] primeA(long N)
		{
		int A[]=new int[2];
		int index=0;
		for (long i = 2; i * i <= N; i++)
			{
			while(N%i==0)
				{
				N = N / i;
				A[index]=(int)i;
				if(index!=1)
					index++;
				}
			}
		return A;
		}
	}

//must declare new classes here