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;
const double PI = 2.0 * acos(0.0);
const int MOD = 1e9 + 9;
const int oo = 2e9 + 1e8;
long long gcd(long long x, long long y) { return !y ? x : gcd(y, x % y); }
const int mx = 4e6;
bitset<mx> prime;
int sieve() {
  prime.set(), prime[1] = 0;
  for (long long i = 2; i < mx; i++)
    if (prime[i]) {
      for (long long j = i * i; j < mx; j += i) prime[j] = 0;
    }
  return 0;
}
int main() {
  long long n, cnt, ret;
  cnt = sieve(), ret = -1;
  scanf("%I64d", &n);
  for (long long i = 1; i * i <= n; i++)
    if (n % i == 0) {
      cnt += 1 + (i * i != n);
      if (ret == -1 && i > 1) ret = (!prime[i]) ? i : n / i;
    }
  if (cnt < 3)
    puts("1\n0");
  else if (cnt < 5)
    puts("2");
  else
    printf("1\n%I64d\n", ret);
  return 0;
}
