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

// Imports
import java.util.*;
import java.io.*;

public class C740 {

    static HashSet<Long> factors;
    public static void loadPrimeFactorization(long n) {
        factors = new HashSet<>();
        
        for(long i = 2; i <= Math.sqrt(n); i++) {
            if(n%i == 0) {
                factors.add(i);
                factors.add(n/i);
            }
        }
    }
    
    
    
    public static boolean isType(long n) {
        int count = 0;
        for(long i = 2; i <= Math.sqrt(n); i++) {
            if(n%i == 0) {
                count += 2;
            }
        }
        
        return (count == 2);
    }
    
    
    /**
     * @param args the command line arguments
     * @throws IOException, FileNotFoundException 
     */
    public static void main(String[] args) throws IOException, FileNotFoundException {
        
        // TODO UNCOMMENT WHEN ALGORITHM CORRECT
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        
        // BufferedReader f = new BufferedReader(new StringReader("30"));
        
        // TODO code application logic here
        long N = Long.parseLong(f.readLine());
        loadPrimeFactorization(N);
        
        for(long i : factors) {
            if(isType(i)) {
                System.out.println("1");
                System.out.println(i);
                System.exit(0);
            }
        }
        
        if(factors.isEmpty()) {
            System.out.println("1");
            System.out.println("0");
        }
        else {
            System.out.println("2");
        }
    }

}
