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.List;
import java.util.Scanner;
import java.util.Vector;

public class C {

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		long g = sc.nextLong();
		if (g == 1 || isPrime(g)) {
			System.out.println("1\n" + 0);
		} else {
			List<Long> list = primeFactors(g);
			boolean status = false;
			long num = 0;
			for (int i = list.size() - 1; !status && i >= 0; i--) {
				if (!isPrime(list.get(i))) {
					status = true;
					num = list.get(i);
				}
			}
			if (status) {
				System.out.println("1\n" + num);
			} else {
				System.out.println(2);
			}
		}
	}

	private static boolean isPrime(long g) {
		if (g == 1)
			return false;

		for (long i = 2; i <= Math.sqrt(g); i++)
			if (g % i == 0) {
				return false;
			}
		return true;
	}

	public static Vector<Long> primeFactors(long numbers) {
		long n = numbers;
		Vector<Long> factors = new Vector<Long>();
		for (long i = 2; i <= n / i; i++) {
			while (n % i == 0) {
				factors.add(i);
				n /= i;
			}
		}
		Vector<Long> factors2 = new Vector<Long>();
		for (int i = factors.size() - 1; i >= 0; i--) {
			long first = factors.get(i);
			for (int j = factors.size() - 1; j >= 0; j--)
				if (i != j) {
					long mul = first * factors.get(j);
					if (mul < numbers) {
						factors2.add(mul);
					}
				}
		}
		for (int i = 0; i < factors2.size(); i++)
			factors.add(factors2.get(i));

		return factors;
	}
}
