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;
const int MOD = (int)1e9 + 7;
const int inf = (int)1e9;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  long long q;
  cin >> q;
  if (q == 1) {
    cout << "1\n0";
    return 0;
  }
  map<long long, int> fac;
  vector<long long> ff;
  long long mul = q;
  for (long long i = 2; i * i <= q; ++i) {
    if (q % i == 0) {
      int c = 0;
      while (q % i == 0) {
        q /= i;
        ++c;
      }
      fac[i] = c;
      ff.push_back(i);
    }
  }
  if (q > 1) {
    fac[q] = 1;
    ff.push_back(q);
  }
  if (ff.size() > 2) {
    cout << "1\n";
    cout << (ff[0] * ff[1]);
  } else if (ff.size() == 2) {
    if (fac[ff[0]] > 1 || fac[ff[1]] > 1) {
      cout << 1 << endl;
      cout << (ff[0] * ff[1]);
    } else
      cout << 2;
  } else if (ff.size() == 1) {
    if (fac[ff[0]] > 2) {
      cout << "1\n";
      cout << ff[0] * ff[0];
    } else if (fac[ff[0]] == 1) {
      cout << "1\n";
      cout << 0;
    } else {
      cout << 2;
    }
  } else {
    cout << 2;
  }
  return 0;
}
