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;
char f[3200001];
int p[1000000];
int main() {
  int m, i, np = 0, k;
  long long n, j;
  for (i = 2; i <= 3200000; i++)
    if (!f[i]) {
      p[np++] = i;
      for (j = i * (long long)i; j <= 3200000; j += i) f[j] = 1;
    }
  scanf("%I64d", &n);
  vector<pair<int, int> > fa;
  int t = 0;
  for (i = 0; (long long)p[i] * p[i] <= n; i++) {
    int c = 0;
    while (n % p[i] == 0) {
      n /= p[i];
      c++;
    }
    if (c) fa.push_back(make_pair(p[i], c));
    t += c;
  }
  if (n > 1) {
    fa.push_back(make_pair(n, 1));
    t++;
  }
  if (t <= 1)
    printf("1\n0\n");
  else if (t == 2) {
    printf("2\n");
  } else if (fa.size() == 1) {
    printf("1\n%d\n", fa[0].first * fa[0].first);
  } else {
    printf("1\n%d\n", fa[0].first * fa[1].first);
  }
  return 0;
}
