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
#include <bits/stdc++.h>
using namespace std;
double a;
long long int n, m1, m2, q, x;
bool b = false, bo = false, boo = false;
int main() {
  cin >> q;
  a = q;
  n = floor(sqrt(a));
  for (int i = 2; i <= n; i++)
    if (q % i == 0) {
      b = true;
      break;
    }
  if (b == false) {
    cout << "1" << endl << "0";
    return 0;
  } else {
    for (int i = 4; i <= n; i++)
      if (q % i == 0) {
        a = i;
        bo = false;
        m1 = floor(sqrt(a));
        boo = false;
        for (int j = 2; j <= m1; j++)
          if (i % j == 0) {
            boo = true;
            j = m1 + 1;
          }
        if (boo == true)
          for (int k = 2; k <= m1; k++) {
            a = k;
            for (int j = 2; j <= floor(sqrt(a)); j++)
              if (k % j == 0) {
                bo = true;
                k = m1 + 1;
                j = floor(sqrt(a)) + 1;
              }
            if (bo == false) {
              cout << 1 << endl << i;
              return 0;
            }
          }
        a = q / i;
        m2 = floor(sqrt(a));
        bo = false;
        x = q / i;
        boo = false;
        for (int j = 2; j <= m2; j++)
          if (x % j == 0) {
            boo = true;
            j = m2 + 1;
          }
        if (boo == true)
          for (int k = 2; k <= m2; k++) {
            a = k;
            for (int j = 2; j <= floor(sqrt(a)); j++)
              if (k % j == 0) {
                bo = true;
                k = m2 + 1;
                j = floor(sqrt(a)) + 1;
              }
            if (bo == false) {
              cout << 1 << endl << x;
              return 0;
            }
          }
      }
  }
  cout << "2";
  return 0;
}
