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 long long maxn = 3162280;
int comp[maxn];
int main() {
  ios::sync_with_stdio(false);
  long long q;
  cin >> q;
  long long cpy = q;
  vector<long long> pr;
  if (q % 2 == 0) {
    pr.push_back(2);
    while (q % 2 == 0) {
      q /= 2;
    }
  }
  if (q % 3 == 0) {
    pr.push_back(3);
    while (q % 3 == 0) {
      q /= 3;
    }
  }
  for (long long i = 6; (i - 5) * (i - 5) < q; i += 6) {
    if (q % (i - 1) == 0) {
      pr.push_back(i - 1);
      while (q % (i - 1) == 0) {
        q /= i - 1;
      }
    }
    if (q % (i + 1) == 0) {
      pr.push_back(i + 1);
      while (q % (i + 1) == 0) {
        q /= i + 1;
      }
    }
    if (pr.size() >= 2) {
      break;
    }
  }
  if (pr.empty()) {
    cout << 1 << endl << 0;
  } else {
    if (pr.size() > 2 or pr[0] * pr[1] < cpy) {
      cout << 1 << endl << pr[0] * pr[1] << endl;
      return 0;
    } else if (pr.size() == 1 and pr[0] * pr[0] < cpy) {
      cout << 1 << endl << pr[0] * pr[0] << endl;
      return 0;
    }
    cout << 2;
  }
  return 0;
}
