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;
constexpr int INF = 1e9 + 1;
constexpr long long LLINF = 1e18 + 1;
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
map<long long, pair<int, long long> > dp;
pair<int, long long> rec(long long n) {
  if (dp.find(n) != dp.end()) return dp[n];
  long long sq = ceil(sqrt(n));
  int cnt = 0;
  pair<int, long long> ret;
  for (int i = 2; i < n && i <= sq; i++)
    if (n % i == 0) {
      ;
      ret = rec(i);
      cnt++;
      if (ret.first == 0) return dp[n] = pair<int, long long>(1, i);
      ret = rec(n / i);
      cnt++;
      if (ret.first == 0) return dp[n] = pair<int, long long>(1, n / i);
    }
  return dp[n] =
             (cnt ? pair<int, long long>(0, -1) : pair<int, long long>(1, 0));
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long n;
  while (cin >> n) {
    pair<int, long long> ans = rec(n);
    ans.first ? printf("1\n") : printf("2\n");
    if (ans.first) printf("%lld\n", ans.second);
  }
}
