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

/**
 *
 * @author koponk
 */
public class soalC {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long n = in.nextLong();
        if (n == 1 || isPrim(n)) {
            System.out.println("1");
            System.out.println("0");
        } else {
            boolean win = find(n);
            if (win) {
                System.out.println("2");
            } else {
                System.out.println("1");
                ArrayList<Long> data = new ArrayList<Long>();
                long a = 2L;
                for (a = 2L; a * a < n; a += 1L) {
                    if (n % a == 0) {
                        data.add(a);
                        data.add(n / a);
                    }
                }
                if (a * a == n) {
                    data.add(a);
                }
                for (int ax = 0; ax < data.size(); ax++) {
                    if (find(data.get(ax))) {
                        System.out.println(data.get(ax));
                        ax = data.size();
                    }
                }
            }
        }
    }
    
    private static boolean find(long n) {
        if (isPrim(n)) {
            return false;
        }
        ArrayList<Long> data = new ArrayList<Long>();
        long a = 2L;
        for (a = 2L; a * a < n; a += 1L) {
            if (n % a == 0) {
                data.add(a);
                data.add(n / a);
            }
        }
        if (a * a == n) {
            data.add(a);
        }
        for (int ax = 0; ax < data.size(); ax++) {
            if (!isPrim(data.get(ax))) {
                return false;
            }
        }
        return true;
    }
    
    public static boolean isPrim(long n) {
        if (n <= 1L) {
            return false;
        }
        if (n == 2L) {
            return true;
        }
        if (n % 2L == 0) {
            return false;
        }
        for (long a = 3L; a * a <= n; a += 1L) {
            if (n % a == 0) {
                return false;
            }
        }
        return true;
    }
}
