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 q;
char prime[4000000 + 1000];
int input() {
  cin >> q;
  return 0;
}
int sieve(long long n) {
  for (long long i = 1; i < n; i++) prime[i] = 1;
  prime[1] = 0;
  for (long long i = 2; i * i <= n; i++) {
    if (!prime[i]) continue;
    for (long long j = i * 2; j < n; j += i) prime[j] = 0;
  }
  return 0;
}
bool isPrime(long long n) {
  if (n == 1) return false;
  if (n < 4000000) return prime[n];
  for (long long i = 2; i * i <= n; i++) {
    if (prime[i] && n % i == 0) return false;
  }
  return true;
}
int factor(long long n, long long &a, long long &b) {
  a = 1;
  b = n;
  for (long long i = 2; i * i <= n; i++) {
    if (prime[i] && n % i == 0) {
      a = i;
      b = n / i;
      break;
    }
  }
  return 0;
}
int solve() {
  sieve(4000000);
  if (q == 1 || isPrime(q)) {
    cout << 1 << endl << 0 << endl;
  } else {
    long long p1, p2;
    factor(q, p1, p2);
    if (isPrime(p2)) {
      cout << 2 << endl;
    } else {
      long long p3, p4;
      factor(p2, p3, p4);
      cout << 1 << endl << p1 * p3 << endl;
    }
  }
  return 0;
}
int main() {
  input();
  solve();
  return 0;
}
