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

public class C107{      
        
        private BufferedReader in;  
        private StringTokenizer st;
        
        long a;
        long x;
        boolean canWin(long n){
            if(n == 1) return true;
            
            boolean can = false;
            boolean div = false;
            for (long i = 2; i*i <= n; i++) {               
                if(n%i == 0){
                    div = true;
                    if(!canWin(i)){
                        if(n == x) a = i;
                        can = true;
                        break;
                    }
                    if(!canWin(n/i)){
                        if(n == x) a = n/i;
                        can = true;
                        break;
                    }
                }
            }           
            if(!div) return true;
            return can;
        }
        int countFactors(long a){
            int ans = 0;
            for (long i = 2; i*i <=a ; i++) {
                while(a %i == 0){
                    a/=i;
                    ans++;
                }
            }
            if(a != 1 ) ans++;
            return ans;
        }
        void solve() throws IOException{

            x = nextLong();
            int c = countFactors(x);
            if(c == 0 || c == 1){
                System.out.println(1);
                System.out.println(0);
            }
            else if(c == 2){
                System.out.println(2);
            }
            else{
                System.out.println(1);
                for (long i = 2; i*i <= x; i++) {
                    if(x%i == 0){
                        if(countFactors(i) == 2){System.out.println(i); break;}
                        if(countFactors(x/i)==2) {System.out.println(x/i); break;}
                    }
                }
            }
            
        }
            

        C107() throws IOException {
            in = new BufferedReader(new InputStreamReader(System.in));          
            eat("");
            solve();            
        }

        private void eat(String str) {
            st = new StringTokenizer(str);
        }

        String next() throws IOException {
            while (!st.hasMoreTokens()) {
                String line = in.readLine();
                if (line == null) {
                    return null;
                }
                eat(line);
            }
            return st.nextToken();
        }

        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        public static void main(String[] args) throws IOException {
            new C107();
        }

        int gcd(int a,int b){
            if(b>a) return gcd(b,a);
            if(b==0) return a;
            return gcd(b,a%b);
        }

}
