#include <bits/stdc++.h>
using namespace std;
bool comp(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
bool comps(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.second == b.second) return a.first < b.first;
  return a.second < b.second;
}
bool prime[1000005];
void primeseries(long long int n) {
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
struct custom_hash {
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    x ^= FIXED_RANDOM;
    return x ^ (x >> 16);
  }
};
bool compmx(int a, int b) { return (a < b); }
void fastio() {
  ios::sync_with_stdio(0);
  cin.tie(0);
}
long long int mod = 1E9 + 7;
void inout() {}
unsigned long long power(unsigned long long x, int y, int p) {
  unsigned long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
unsigned long long modInverse(unsigned long long n, int p) {
  return power(n, p - 2, p);
}
unsigned long long nCr(unsigned long long n, int r, int p) {
  if (n < r) return 0;
  if (r == 0) return 1;
  unsigned long long fac[n + 1];
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % p;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
bool chk(long long int i, long long int a, long long int b, long long int n) {
  long long int x = i * a + (n - i) * b;
  bool r = true;
  while (x) {
    if (x % 10 != a && x % 10 != b) return false;
    x /= 10;
  }
  return true;
}
vector<long long int> primefac(long long int n) {
  vector<long long int> m;
  while (n % 2 == 0) {
    m.push_back(2);
    n = n / 2;
  }
  for (long long int i = 3; i * i <= n; i = i + 2) {
    while (n % i == 0) {
      m.push_back(i);
      n = n / i;
    }
  }
  if (n > 2) m.push_back(n);
  return m;
}
int main() {
  fastio();
  long long int n;
  cin >> n;
  vector<long long int> ans = primefac(n);
  if (ans.empty() || ans.size() == 1 || ans.size() > 2) {
    cout << 1;
    cout << "\n";
    ;
    if (!ans.empty() && ans.size() != 1) {
      cout << ans[0] * ans[1];
    } else
      cout << 0;
  } else
    cout << 2;
  return 0;
}
