#include <bits/stdc++.h>
using namespace std;
long long q, p, d[1000000], c[1000000];
int i, l;
bool flag = true;
int main() {
  cin >> q;
  if (q == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  p = floor(sqrt(q));
  for (i = 2; i <= p; i++)
    if (q % i == 0) {
      flag = false;
      l++;
      c[l] = i;
      while (q % i == 0) {
        q /= i;
        d[l]++;
      }
    }
  if (q > 1) {
    l++;
    c[l] = q;
  }
  if (flag) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  if ((l == 1 && d[1] <= 2) || (l == 2 && d[1] < 2 && d[2] < 2)) {
    cout << 2 << endl;
    return 0;
  } else {
    cout << 1 << endl;
    if (l > 1)
      cout << (long long)c[1] * c[2];
    else
      cout << (long long)c[1] * c[1];
    return 0;
  }
}
