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 iscomp[5000005];
vector<int> prime;
void sieve(int n) {
  fill(iscomp, iscomp + n, false);
  for (int i = 2; i < n; i++) {
    if (!iscomp[i]) prime.push_back(i);
    for (int j = 0; j < prime.size() and i * prime[j] < n; j++) {
      iscomp[i * prime[j]] = true;
      if (i % prime[j] == 0) break;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  sieve(5000002);
  int q;
  cin >> q;
  int su = 0;
  int pf = -1;
  int p = q;
  if (q == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  for (int i = 0; i < prime.size(); i++) {
    while (q % prime[i] == 0) {
      pf = prime[i];
      su++;
      q /= prime[i];
    }
  }
  if (q != 1) su++, pf = q;
  if (su % 2) {
    cout << 1 << endl;
    if (p != pf)
      cout << p / pf << endl;
    else {
      cout << 0 << endl;
    }
  } else {
    cout << 2 << endl;
  }
}
