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

/**
 * Created by IntelliJ IDEA.
 * User: mihai
 * Date: 2/3/12
 * Time: 10:46 PM
 */
public class problemC {
    private static final int nMax = 100005;
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        long N1 = N;
        long x = -1, y = -1, d = 2;
        int nrImp = 0;
        
        if (N == 1) {
            System.out.println(1); System.out.println(0); return;
        }

        while (N1 != 1) {
            while (N1 % d == 0) {
                N1 /= d;
                nrImp++;
                if (x == -1) {
                    x = d;
                } else {
                    if (y == -1) {
                        y = d;
                    }
                }
            }
            d += 1;
        }

        if (nrImp == 2) {
            System.out.println(2);
        } else {
            System.out.println(1);
            System.out.println(x * y);
        }
    }
}
