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;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long int n;
  cin >> n;
  long long int tmp = n;
  if (n == 1) {
    cout << 1 << '\n' << 0;
    return 0;
  }
  long long int d = 3;
  int cnt = 0;
  vector<pair<int, int> > prime_div;
  while (n % 2 == 0) {
    cnt++;
    n >>= 1;
  }
  prime_div.push_back({2, cnt});
  cnt = 0;
  for (; d * d <= n; d += 2) {
    if (n % d == 0) {
      while (n % d == 0) {
        cnt++;
        n /= d;
      }
      prime_div.push_back({d, cnt});
      cnt = 0;
    }
  }
  if (n > 2) prime_div.push_back({n, 1});
  if (prime_div.size() == 1) {
    if (prime_div[0].second == 2)
      cout << 2;
    else {
      cout << 1 << '\n';
      if (prime_div[0].second == 1)
        cout << 0;
      else {
        long long int p = prime_div[0].first;
        int a = prime_div[0].second - 2;
        cout << (long long int)pow(p, a);
      }
    }
  } else {
    long long int ans = 1;
    ans = prime_div[0].first * prime_div[1].first;
    if (ans == tmp)
      cout << 2;
    else
      cout << 1 << '\n' << ans;
  }
  return 0;
}
