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;
bool isComposite(long long num) {
  for (long long i = 2; i * i <= num; i++)
    if (num % i == 0) return true;
  return false;
}
int main() {
  long long q, i, fac1 = -1, fac2 = -1, fax = 0;
  cin >> q;
  if (q == 1 || q == 2 || q == 3 || q == 5 || q == 7) {
    cout << "1\n0\n";
    return 0;
  }
  for (i = 2; i * i <= q; i++)
    if (!(q % i)) {
      fax += 2;
      if (fac1 == -1)
        fac1 = i;
      else if (fac2 == -1)
        fac2 = i;
    }
  if (fax == 0) {
    cout << "1\n0\n";
    return 0;
  }
  if (fax == 2) {
    cout << "2\n";
    return 0;
  }
  cout << "1\n";
  if (!isComposite(fac1) && !isComposite(fac2))
    cout << fac2 * fac1 << "\n";
  else if (isComposite(fac1))
    cout << fac1 << "\n";
  else
    cout << fac2 << "\n";
  return 0;
}
