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.io.BufferedReader;
import java.io.IOException;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class C {
  FastScanner in;
  PrintWriter out;

  public void run() {
    try {
      in = new FastScanner(new InputStreamReader(System.in));
      out = new PrintWriter(System.out);
      solve();
      out.close();
    } catch (IOException e) {
      e.printStackTrace();
    }
  }

  public static void main(String[] arg) {
    C o = new C();
    o.run();
  }

  public void solve() throws IOException {
    long q = Long.valueOf(in.nextLine());
    if (q == 1 || q == 2) { // simplest number. First wins immediately.
      out.println(1);
      out.println(0);
      return;
    }
    int z = 1000001;
    boolean [] seed = new boolean[z];
    for (int i=0; i<z; i++) {
      seed[i] = true;
    }
    for (int i=2; i<z; i++) {
      if (seed[i]) {
        for (int j=2*i; j<z; j+=i) {
          seed[j] = false;
        }
      }
    }

    TreeSet<Long> divs = new TreeSet<Long>();
    for (long i=2; i*i <= q; i++) {
      if (q % i == 0) {
        divs.add(i);
        divs.add(q / i);
      }
    }
    if (divs.isEmpty()) {
      out.println(1);
      out.println(0);
      return;
    }
    while (!divs.isEmpty()) {
      long att = divs.pollFirst();
      for (int i = 2; i < z; i++) {
        if (att != i && att % i == 0 && seed[(int)(att / i)]) {
          out.println(1);
          out.println(att);
          return;
        }
      }
    }

    out.println(2);
  }

  class FastScanner {
    BufferedReader br;
    StringTokenizer st;

    FastScanner(FileReader in) {
      br = new BufferedReader(in);
    }

    FastScanner(InputStreamReader in) {
      br = new BufferedReader(in);
    }

    String nextLine() {
      String str = null;
      try {
        str = br.readLine();
      } catch (IOException e) {
        e.printStackTrace();
      }

      return str;
    }

    String next() {
      while (st == null || !st.hasMoreTokens()) {
        try {
          st = new StringTokenizer(br.readLine());
        } catch (IOException e) {
          e.printStackTrace();
        }
      }
      return st.nextToken();
    }

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

}