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;
vector<int> primes;
void prime(long long n) {
  primes.push_back(2);
  long long k = 3;
  while (k * k <= n) {
    bool is_prime = true;
    for (int i = 0; i < primes.size() && primes[i] * primes[i] <= k && is_prime;
         i++)
      if (k % primes[i] == 0) is_prime = false;
    if (is_prime) primes.push_back(k);
    k += 2;
  }
}
int main() {
  long long int q, t;
  cin >> q;
  t = q;
  prime(q);
  vector<int> factors;
  for (int i = 0; i < primes.size() && q > 1; i++) {
    while (q % primes[i] == 0) {
      factors.push_back(primes[i]);
      q /= primes[i];
    }
  }
  if (q > 1) factors.push_back(q);
  if (factors.size() <= 1)
    cout << "1\n0" << endl;
  else if (factors.size() == 2)
    cout << "2" << endl;
  else
    cout << "1\n" << factors[0] * factors[1] << endl;
  return 0;
}
