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.Arrays;
import java.util.Scanner;
import static java.lang.Math.*;

public class c107 {
    public static void debug(Object... obs) {
        System.out.println(Arrays.deepToString(obs));
    }

    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        
        
        
        long l=sc.nextLong();
        int up=(int)Math.sqrt(l);
        
        boolean[]prim=new boolean[up+1];
        
        prim[0]=true;
        prim[1]=true;
        
        for(int i=2;i*i<=up;i++)
        {
            if(prim[i])
            {
                continue;
            }
            for(int j=2*i;j<=up;j+=i)
            {
                prim[j]=true;
            }
        }
        //debug(prim);
        long res=1;
        long z=l;
        while(z > 1)
        {
            boolean found=false;
            for(long i=2;i*i<=z;i++)
            {
                if(z%i==0 && !prim[(int)i])
                {
                    //debug(z,i,res);
                    if(res==1)
                        res*=i;
                    else
                    {
                        res*=i;
                        System.out.println(1);
                        System.out.println(res);
                        return;
                    }
                    z/=i;
                    found=true;
                    break;
                }
            }
            
            if(!found && z>1 && isPrime(z))
            {
                break;
            }
        }
        if(res==1)
        {
            System.out.println(1);
            System.out.println(0);
            return;
        }
        
        System.out.println(2);
    }

    private static boolean isPrime(long z) {
        for(long i=2;i*i<=z;i++)
        {
            if(z%i==0)
            {
                return false;
            }
        }
        return true;
    }
}
