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;
long long _sieve_size;
bitset<10000010> bs;
vector<int> primes;
void sieve(long long upperbound) {
  _sieve_size = upperbound + 1;
  bs.set();
  bs[0] = bs[1] = 0;
  for (long long i = 2; i <= _sieve_size; i++) {
    if (bs[i]) {
      for (long long j = i * i; j <= _sieve_size; j += i) bs[j] = 0;
      primes.push_back((int)i);
    }
  }
}
int main() {
  sieve(3200000);
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  long long q;
  cin >> q;
  long long result = 1;
  long long aux;
  bool flag = false;
  if (q == 1) flag = true;
  int div = 0;
  for (int i = 0; i < primes.size(); i++) {
    aux = (long long)primes[i];
    while (q % aux == 0) {
      q /= aux;
      if (div <= 1) result *= aux;
      div++;
    }
    if (aux > q) break;
  }
  if (q != 1) {
    if (div <= 1) result *= aux;
    div++;
  }
  if (div == 1) flag = true;
  if (flag) {
    cout << "1\n0\n";
  } else {
    if (div == 2) {
      cout << "2\n";
    } else {
      cout << "1\n" << result << "\n";
    }
  }
  return 0;
}
