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;
long long int q, n, m, a[10000];
double x;
bool cmp(long long int x, long long int y) { return x < y; }
bool IsPrime(long long int qwe) {
  long long int s;
  double d;
  d = qwe;
  s = floor(sqrt(d));
  for (int i = 2; i <= s; i++)
    if (qwe % i == 0) {
      i = s + 1;
      return false;
    }
  return true;
}
int main() {
  cin >> q;
  if (IsPrime(q))
    cout << 1 << endl << 0;
  else {
    x = q;
    n = floor(sqrt(x));
    for (int i = 2; i <= n; i++) {
      if (q % i == 0) {
        if (IsPrime(i)) {
          a[m] = i;
          m++;
        }
        if (IsPrime(q / i)) {
          a[m] = q / i;
          m++;
        }
      }
    }
    sort(a, a + m, cmp);
    if (m == 1 && a[0] * a[0] == q)
      cout << 2;
    else if (m == 1 && a[0] * a[0] != q)
      cout << 1 << endl << a[0] * a[0];
    else if (m == 2 && a[0] * a[1] == q)
      cout << 2;
    else if (m == 2 && a[0] * a[0] != q)
      cout << 1 << endl << a[0] * a[0];
    else
      cout << 1 << endl << a[0] * a[1];
  }
  return 0;
}
