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 long long mod = 1000000007;
template <typename T, typename U>
static inline void amin(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T &x, U y) {
  if (x < y) x = y;
}
vector<long long> m;
void primeFactors(long long n) {
  while (n % 2 == 0) {
    m.push_back(2);
    n = n / 2;
  }
  for (long long i = 3; i <= sqrt(n); i = i + 2) {
    while (n % i == 0) {
      m.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) m.push_back(n);
}
bool isprime(long long n) {
  if (n == 2 && n == 1 && n == 33)
    return true;
  else {
    for (int i = (2); i < (sqrt(n) + 1); i++) {
      if (n % i == 0)
        return false;
      else {
        continue;
      }
    }
    return true;
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  long long tc = 1;
  for (long long t = 0; t < tc; t++) {
    long long n;
    cin >> n;
    if (isprime(n)) {
      cout << 1 << endl << 0 << endl;
    } else {
      long long ans = 1;
      long long prev = 0;
      primeFactors(n);
      for (int i = (0); i < (m.size()); i++) {
        ans *= m[i];
      }
      if (m.size() <= 2)
        cout << 2 << endl;
      else {
        cout << 1 << endl << ans / m[m.size() - 1] << endl;
      }
    }
  }
  return 0;
}
