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;
bool arr[10000005];
void sieve() {
  for (int i = 3; i * i <= 10000000; i += 2) {
    if (arr[i] == 0) {
      for (int j = i * i; j <= 10000000; j += i) arr[j] = 1;
    }
  }
}
vector<long long> pr, vv;
long long q;
void DIV() {
  long long p = q;
  for (int i = 0; i < pr.size() && pr[i] <= p; i++) {
    if (p % pr[i] == 0) {
      while (p % pr[i] == 0) {
        p /= pr[i];
      }
      vv.push_back(pr[i]);
    }
  }
  if (p > 1) vv.push_back(p);
}
int main() {
  sieve();
  pr.push_back(2);
  for (int i = 3; i <= 10000000; i += 2) {
    if (arr[i] == 0) pr.push_back(i);
  }
  scanf("%I64d", &q);
  if (q == 1) {
    printf("1\n0\n");
    return 0;
  }
  DIV();
  if (vv.size() == 0) {
    cout << "1" << endl << "0" << endl;
  } else if (vv.size() == 1 && vv[0] == q) {
    cout << "1" << endl << "0" << endl;
  } else if (vv.size() == 1 && vv[0] * vv[0] == q) {
    cout << "2" << endl;
  } else if (vv.size() == 2 && vv[0] * vv[1] == q) {
    cout << "2" << endl;
  } else {
    long long ans;
    if (vv.size() == 1)
      ans = vv[0] * vv[0];
    else
      ans = vv[0] * vv[1];
    cout << "1" << endl << ans << endl;
  }
}
