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>
const double EPS = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1; }
inline void fast() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
  std::cerr.tie(NULL);
}
using namespace std;
vector<int> Primes, res;
long long n, z;
bool vis[3162279 + 3];
int main() {
  memset(vis, false, sizeof(vis));
  Primes.push_back(2);
  for (int i = 3; i <= 3162279; i += 2)
    if (!vis[i]) {
      vis[i] = true;
      Primes.push_back(i);
      for (int j = i; j <= 3162279; j += i) vis[j] = true;
    }
  cin >> n;
  z = n;
  int sz = 0, doub = -1;
  for (auto j : Primes) {
    if (j > n) break;
    if (n % j == 0) {
      sz++;
      res.push_back(j);
      n /= j;
      if (n % j == 0) {
        doub = j;
        n /= j;
      }
    }
  }
  if (doub != -1) {
    if ((long long)doub * doub == z)
      cout << 2;
    else
      cout << "1\n" << (long long)doub * doub;
  } else if (sz == 0)
    cout << "1\n0";
  else if (sz == 1) {
    if (res[0] == z)
      cout << "1\n0";
    else
      cout << 2;
  } else if (sz == 2)
    cout << 2;
  else
    cout << "1\n" << res[0] * res[1];
}
