#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const double PI = 3.141592653589793238463;
const int INF = 0x3f3f3f3f;
const int INFS = 1000000000;
const long long LLINF = 9223372036854775807;
const int M = 1000000007;
const double EPS = 1e-9;
const int p = 43;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long q;
  cin >> q;
  if (q == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  vector<long long> ds;
  for (long long i = 2; i * i <= q; ++i) {
    while (q % i == 0) {
      q /= i;
      ds.push_back(i);
    }
  }
  if (q != 1) ds.push_back(q);
  long long n = ds.size();
  if (n == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  for (long long i = 1; i < n; i++) ds[i] = ds[i - 1] * ds[i];
  vector<long long> dp(n + 1);
  dp[0] = -1;
  dp[1] = 0;
  for (long long i = 2; i < n + 1; i++) {
    dp[i] = -1;
    for (long long j = 1; j < i; j++) {
      if (dp[j] == -1) dp[i] = ds[j - 1];
    }
  }
  if (dp[n] == -1) {
    cout << 2 << endl;
  } else {
    cout << 1 << endl;
    cout << dp[n] << endl;
  }
  return 0;
}
