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;
const double pi = acos(-1.0);
const double EPS = 1e-9;
const int BIG_PRIME7 = 1000000007;
const int BIG_PRIME9 = 1000000009;
char ch;
long long i, j, n, m, k;
long long N, C;
long long arr[1000];
long long q;
vector<long long> p;
bool isPrime(long long x) {
  long long i = 0;
  if (x == 2) return true;
  if (x % 2 == 0) return false;
  for (i = 3; i * i <= x; i += 2) {
    if (x % i == 0) return false;
  }
  return true;
}
bool hasAllprimes(long long x) {
  if (isPrime(x)) return false;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      if (!isPrime(i) || !isPrime(x / i)) return false;
    }
  }
  return true;
}
int main() {
  cin >> q;
  if (q == 1 || isPrime(q)) {
    cout << "1" << endl;
    cout << "0" << endl;
    return 0;
  }
  for (long long i = 2; i * i <= q; i++) {
    if (q % i == 0) {
      p.push_back(i);
      p.push_back(q / i);
    }
  }
  for (long long i = 0; i < p.size(); i++) {
    if (hasAllprimes(p[i])) {
      cout << "1" << endl;
      cout << p[i] << endl;
      return 0;
    }
  }
  cout << "2" << endl;
  return 0;
}
