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.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.TreeMap;


public class Main {

    public static void main(String[] args) throws Exception {
        BufferedReader in  = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(in.readLine());
        long n = Long.parseLong(st.nextToken());
        TreeMap<Long, Long > fact = descomposicionPrima(n);
        int con = 0;

        long a=-1, b=-1 ;
        for(Entry<Long, Long> x : fact.entrySet()){
            con+= x.getValue();
            if(x.getValue()>=2)
            {
                a=x.getKey();
                b = x.getKey();
            }
            else{
                if(a== -1)
                    a = x.getKey();
                else if(b==-1)
                    b = x.getKey();
            }

        }
        if(con <= 1){
            System.out.println(1);
            System.out.println(0);
        }
        else if(con == 2){
            System.out.println(2);
        }else{
            System.out.println(1);
            System.out.println(a*b);
        }

    }

    static TreeMap<Long, Long> descomposicionPrima (long n){
        TreeMap<Long, Long>  res = new TreeMap<Long, Long>();
        long cont , i , R , N ;
        for(cont = 0 , i = 2 ,R = (long) Math.sqrt(n), N = n; N> 1 && i<= R; ++i ){
            if( N %i == 0){
                cont++;
                N/=i; i--;
            }else if(cont>0){
                res.put(i, cont);
                cont=0;
            }
        }
        if(cont>0)res.put(i, cont);
        if(N != 1) res.put(N, 1L);

        return res;
    }
}
