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
//package clirr;
import java.util.*;
import java.io.*;

public class Main {

    public static void main(String[] args){
        Scanner I = new Scanner(System.in);
        PrintWriter O = new PrintWriter(System.out);
        long q, n;
        q = I.nextLong();
        int a = 1, t = 0;
        int[] d = new int[3500001];
        Queue<Integer> s = new LinkedList();
        for (int i = 2; i <= 3500000; i++){
            d[i] = 0;
        }
        n = q;
        for (int i = 2; i <= 3500000; i++){
            if (d[i] == 0){
                s.add(i);
                for (int j = 2; i*j <= 3500000; j++)
                    d[i*j] = 1;
            }
        }
        for (; s.isEmpty() == false && s.peek() <= q; ){
            int i = s.peek();
            if (q % i < 1){
             //    O.println(i);
                 q /= i;
                 if (a > 1){
                     if (q > 1){
                         O.print(1 + "\n" + a * i);
                         t = 1;
                         break;
                     }
                     else{
                         t = 2;
                         break;
                     }
                 }
                 else
                    a *= i;
            }
            else
                s.poll();
        }
        if (t == 0 && a == 1 || a == n)
            O.print(1 + "\n" + 0);
        else if ((t == 0 && a != 1 || t == 2) && a != n)
            O.print(2);
        O.close();

    }

}