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.io.IOException;
import java.util.Arrays;
import java.util.Locale;
import java.util.Scanner;

public class C {

	private void processInput() throws IOException {
		Scanner in = new Scanner(System.in);

		long q = in.nextLong();
		go(q);

		in.close();
	}

	int[] memo;
	private void go(long n) {

		memo = new int[20000000];
		Arrays.fill(memo, -1);
		if (n == 1 || isPrime(n)) {
			System.out.printf(Locale.ENGLISH, "%d\n%d\n", 1, 0);
			return;
		}

		boolean res = !isWinning(n);
		
		if (res) {
			for (long i = 2; i*i <= n; i++) {
				if (n % i == 0) {
					System.out.printf(Locale.ENGLISH, "1\n%d\n", n / i);
					break;
				}
			}
		} else {
			System.out.printf(Locale.ENGLISH, "2\n");	
		}
		

	}

	boolean isWinning(long n) {

		if (n < memo.length) {
			if (memo[(int) n]  != -1) {
				return memo[(int) n] == 0;
			}
		}
		if (isPrime(n)) {
			return false;
		} else {
		    for (long i = 2; i*i <= n; i++) {
		    	if (n % i == 0) {
		    		if (!isWinning(n / i)) {
		    			if (n < memo.length) {
		    				memo[(int) n] = 1;
		    			}
		    			return true;
		    		}
		    	}
		    }
		    if (n < memo.length) {
		    	memo[(int) n] = 0;
		    }
		    return false;
		}
	}


    private boolean isPrime(long n) {
		if (n <= 1) {
			return false;
		}
		if (n == 2) {
			return true;
		}
		if (n % 2 == 0) {
			return false;
		}

		for (long i = 3; i*i <= n; i += 2) {
			if (n % i == 0) {
				return false;
			}
		}
		return true;
	}
	public static void main(String[] args) throws Exception {
		C a = new C();
		a.processInput();
		
//		for (int i = 4; i < 500; i++) {
//			System.out.printf("%d - %b\n", i, a.isWinning(i));
//		}
	}
}