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>
const long long N = 2e5 + 10, MOD = 1e9 + 7;
using namespace std;
int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
long long n, t, ans;
long long div(long long n) {
  long long tmp = n, res = 1, cnt = 0;
  for (long long p = 2; p * p <= n; ++p) {
    int e = 0;
    while (tmp % p == 0) {
      ++e;
      tmp /= p;
    }
    if (e && cnt < 2) e > 1 ? res = p * p, cnt = 2 : res *= p, cnt++;
  }
  if (tmp != n && cnt < 2) res *= tmp;
  return res == 1 ? 0 : res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  long long ans = div(n);
  if (!ans || (div(ans) && ans != n))
    cout << 1 << '\n' << ans;
  else
    cout << 2;
  return 0;
}
