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.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;

public class WinOrFreeze {
	public static void main(String[] args) throws Exception{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		long q = Long.parseLong(in.readLine().trim());
		int n = (int) (Math.sqrt(q) + 10);
		boolean[] sieve = new boolean[n];
		Arrays.fill(sieve, true);
		sieve[0] = sieve[1] = false;
		ArrayList<Long> primes = new ArrayList<Long>();
		
		for(int i = 2; i < n ; ++i){
			long sq = ((long) i) * ((long) i);
			if(sieve[i]){
				primes.add((long) i);
				if( (sq < n)){
					for(int j = i*i; j < n ; j+=i){
						sieve[j] = false;
					}
				}
			}
		}
		if(q < 4){
			out.println("1\n0");
		} else {
			int[] cnt = new int[primes.size()];
			boolean oneWins = false;
			int count = 0;
			long qr = q;
			for(int i = 0; q > 1 && i < primes.size(); ++i){
				while(q % primes.get(i) == 0){
					q /= primes.get(i);
					cnt[i]++;
					count++;
				}
			}
			if(count > 2)
				oneWins = true;
			if(q == qr || ((qr < n) && sieve[(int)qr])){
				out.println("1\n0");
			} else if(!oneWins) {
				out.println(2);
			} else {
				out.println(1);
				long res = 1;
				int prod = 0;
				for(int i = 0; prod < 2 && i < primes.size(); ++i){
					if(cnt[i] > 1){
						res = primes.get(i) * primes.get(i);
						prod = 2;
					} else if( cnt[i] !=0){
						res *= primes.get(i);
						prod++;
					}
				}
				out.println(res);
			}
		}
		in.close();
		out.close();
	}
}
