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.*;

public class Problem {
	static int MAXP=3162278;
	static boolean divisible[];
	
	static void sieve(int N) { 
	    divisible = new boolean[N+1]; 
	    divisible[1] = true; 
	    int raiz = (int)Math.sqrt(N); 
	    for(int i=2; i<=raiz; i++) 
	        if(!divisible[i]) 
	            for(int k=i+i; k<=N; k+=i) 
	                divisible[k]=true; 
	} 
	static long div=-1;
	
	static boolean win(long Q) {
		
		boolean puedeDividir=false;
		for(long i=2; i*i<=Q; i++) {
			if(Q%i==0) {
				puedeDividir=true;
				if(!win(i)) {
					div=i;
					return true;
				}
				else if(!win(Q/i)) {
					div=Q/i;
					return true;
				}
			}
		}
		if(puedeDividir) return false;
		return true;
	}
	
	public static void main(String[] args) {
		//System.out.println(win(2));
		//System.out.println(win(8));
		
		Scanner input = new Scanner(System.in);
		long Q = input.nextLong();
		boolean w=win(Q);
		System.out.println(w?1:2);
		if(w && div!=-1) System.out.println(div);
		
	}
	
	public static void main2(String[] args) {
		Scanner input = new Scanner(System.in);
		long Q = input.nextLong();
		System.out.println(win(2));
		if(BigInteger.valueOf(Q).isProbablePrime(80)) {
			System.out.println("1");
			System.out.println("0");
			return;
		}
		
		sieve(MAXP);
		
		for(int i=MAXP-1; i>2; i--) if(!divisible[i]) {
	        if(Q%i!=0) continue;
            long o = Q/i;
            if(o<MAXP) {
            	if(!divisible[(int)o]) {
            		System.out.println("1");
            		System.out.println(o);
            		return;
            	}
            }
            else if(BigInteger.valueOf(o).isProbablePrime(80)) {
        		System.out.println("1");
        		System.out.println(i);
        		return;
            }
	    }
		System.out.println("2");
	}

}
