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 q;
vector<long long int> p;
void Sieve(int k) {
  bool prime[k + 1];
  memset(prime, true, sizeof(prime));
  for (int i = 2; i <= k; i++) {
    if (prime[i] == true) {
      for (int j = i * 2; j <= k; j += i) prime[j] = false;
      p.push_back(i);
    }
  }
}
void primefactors(long long int N) {
  long long int ini = N;
  vector<long long int> factors;
  long long int idx = 0, PF = p[idx];
  long long int tot = 0;
  while (PF * PF <= N) {
    while (N % PF == 0) {
      N /= PF;
      tot++;
      if (factors.size() <= 3)
        factors.push_back(PF);
      else
        break;
    }
    PF = p[++idx];
  }
  if (N != 1 && N != ini) tot++, factors.push_back(N);
  cout << "factors.size()"
       << " = " << (factors.size()) << std::endl;
  if (factors.size() > 2) {
    cout << 1 << "\n";
    cout << factors[0] * factors[1];
  } else {
    cout << 2;
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> q;
  if (q == 1) {
    cout << 1 << "\n";
    cout << 0;
    return 0;
  }
  Sieve(1e6);
  primefactors(q);
  return 0;
}
