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 int number;
vector<long long int> divisor;
int main() {
  cin >> number;
  if (number <= long long int(3)) {
    cout << "1" << endl << "0" << endl;
    return 0;
  }
  int limit = int(sqrt(number));
  int i = 3;
  while (number % long long int(2) == long long int(0)) {
    number /= long long int(2);
    divisor.push_back(long long int(2));
  }
  while (i <= limit) {
    if (number % long long int(i) == long long int(0)) {
      number /= long long int(i);
      divisor.push_back(long long int(i));
    } else
      i += 2;
  }
  if (number > long long int(1)) divisor.push_back(number);
  if (divisor.size() == 1)
    cout << "1" << endl << "0" << endl;
  else if (divisor.size() % 2 == 0)
    cout << "2" << endl;
  else
    cout << "1" << endl << divisor[0] * divisor[1] << endl;
  return 0;
}
