#include <bits/stdc++.h>
using namespace std;
long long n;
int i, sumE;
long long Base[10000], Exp[10000];
int main() {
  memset(Base, 0, sizeof(Base));
  memset(Exp, 0, sizeof(Exp));
  cin >> n;
  sumE = 0;
  for (i = 2; i <= int(sqrt(n)); ++i) {
    if (n % i == 0) {
      Base[++Base[0]] = i;
      ++Exp[0];
      while (n % i == 0) {
        n /= i;
        ++Exp[Exp[0]];
        ++sumE;
      }
    }
  }
  if (Base[Base[0]] < n) {
    Base[++Base[0]] = n;
    Exp[++Exp[0]] = 1;
    ++sumE;
  }
  if (sumE == 1) {
    cout << 1 << endl;
    cout << 0;
  } else {
    if (sumE > 2) {
      cout << 1 << endl;
      if (Base[0] > 1)
        cout << Base[1] * Base[2];
      else
        cout << Base[1] * Base[1];
    }
    if (sumE == 2) cout << 2;
  }
  return 0;
}
