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

public class C {
	static boolean[] v = new boolean[10000010];

	public static void sieve() {
		int r = v.length, i, j;
		v[1] = true;
		v[0] = true;
		for (j = 2; 2 * j < r; j++)
			v[2 * j] = true;
		for (i = 3; (j = i * i) < r; i += 2)
			if (!v[i])
				for (; j < r; j += i + i)
					v[j] = true;
	}

	public static boolean isPrime(long r) {
		if (r == 1)
			return false;
		if (r % 2 == 0 && r != 2)
			return false;
		if (r < v.length)
			return !v[(int) r];
		for (int i = 3; i < v.length && i * i <= r; i += 2)
			if (!v[i] && r % i == 0)
				return false;
		return true;
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		long q = in.nextLong();
		sieve();
		if (q == 0) {
			System.out.println(1);
			System.out.println(0);
		} else if (q == 1) {
			System.out.println(1);
			System.out.println(0);
		} else if (isPrime(q)) {
			System.out.println(1);
			System.out.println(0);
		} else {
			long qq = q;
			int cnt = 0;
			long win = 1;

			for (int i = 2; i * i <= q; i++) {
				if (q % i == 0 && !v[i]) {
					win *= i;
					cnt++;
					q /= i;
					while (q % i == 0) {
						if (cnt == 2) {
							if (win == qq) {
								System.out.println(2);
							} else {
								System.out.println(1);
								System.out.println(win);
							}
							System.exit(0);
						}
						q /= i;
						cnt++;
						win *= i;
					}
					if (cnt == 2) {
						if (win == qq) {
							System.out.println(2);
						} else {
							System.out.println(1);
							System.out.println(win);
						}
						System.exit(0);
					}
					if (isPrime(q)) {
						win *= q;
						cnt++;
						q = 1;
					}
					if (cnt == 2) {
						if (win == qq) {
							System.out.println(2);
						} else {
							System.out.println(1);
							System.out.println(win);
						}
						System.exit(0);
					}
				}

			}
		}
	}
}