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.Scanner;

public class C {
    static long[] primes = new long[3200000];
    static int cnt;

    public static void sieve() {
        cnt = 0;
        primes[cnt++] = 2;
        int sqrt = (int) (Math.sqrt(3200000) + 1);
        int[] marks = new int[50000];
        for (int i = 3; i <= sqrt; i += 2) {
            if ((marks[i >> 6] & (1 << ((i >> 1) & 31))) == 0) {
                for (int j = i * i; j <= 3200000; j += (i << 1)) {
                    marks[j >> 6] |= (1 << ((j >> 1) & 31));
                }
            }
        }
        for (int i = 3; i <= 3200000; i += 2) {
            if ((marks[i >> 6] & (1 << ((i >> 1) & 31))) == 0) {
                primes[cnt++] = i;
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong(), tmp = n;
        if (n == 2) {
            System.out.println(1);
            System.out.println(0);
            return;
        }
        sieve();
        long sqrt = (long) Math.sqrt(n) + 1;
        long res = 1;
        int factors = 0;
        for (int i = 0; i < cnt && primes[i] <= sqrt; i++) {
            if (n % primes[i] == 0) {
                int count = 0;
                while (n % primes[i] == 0) {
                    n /= primes[i];
                    count++;
                }
                if (count > 1) {
                    if (primes[i]*primes[i]<n) {
                        System.out.println(1);
                        System.out.println(primes[i] * primes[i]);
                        return;
                    } else {
                        System.out.println(2);
                        return;
                    }
                }
                if (factors < 2) {
                    res *= primes[i];
                }
                factors++;
            }
        }
        if (n == tmp) {
            System.out.println(1);
            System.out.println(0);
        } else {
            if (n > 1)
                factors++;
            if (factors > 2) {
                System.out.println(1);
                System.out.println(res);
            } else
                System.out.println(2);
        }
    }
}
