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 long long MOD = (1e9) + 7;
const double EPS = (1e-7);
int dcmp(double x, double y) { return abs(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;
bitset<3162278> vis;
long long x;
int main() {
  vis = 0;
  cin >> x;
  long long ans = 1;
  int con = 0;
  while (x != 1 && x % 2 == 0) {
    if (con < 2) {
      ans *= 2;
      con++;
    } else {
      cout << "1\n" << ans;
      return 0;
    }
    x /= 2;
  }
  for (int i = 3; i < 3162278; i += 2)
    if (vis[i] == 0) {
      while (x != 1 && x % i == 0) {
        if (con < 2) {
          ans *= i;
          con++;
        } else {
          cout << "1\n" << ans;
          return 0;
        }
        x /= i;
      }
      if (x == 1) break;
      for (int j = i; j < 3162278; j += i) vis[i] = 1;
    }
  if (con == 2)
    cout << "2";
  else
    cout << "1\n0";
}
