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;
const int MAXP = 1299709;
int prime[MAXP];
bool is_prime[MAXP];
void prime_list() {
  memset(is_prime, true, sizeof(is_prime));
  for (int i = 2; i <= MAXP; i++) {
    if (is_prime[i]) prime[++prime[0]] = i;
    for (int j = 1, k; (j <= prime[0]) && (k = i * prime[j]) <= MAXP; j++) {
      is_prime[k] = false;
      if (i % prime[j] == 0) break;
    }
  }
}
int cnt[MAXP];
int main() {
  prime_list();
  long long n;
  cin >> n;
  if (n == 1) {
    cout << 1 << endl << 0 << endl;
    return 0;
  }
  for (int i = 1; i <= prime[0]; ++i) {
    while (n % prime[i] == 0) {
      ++cnt[i];
      n /= prime[i];
    }
  }
  if (n > 1) cnt[0]++;
  int sum = 0;
  for (int i = 1; i <= prime[0]; ++i) {
    sum += cnt[i];
  }
  sum += cnt[0];
  long long ans = 1;
  if (sum == 2)
    cout << 2 << endl;
  else {
    cout << 1 << endl;
    if (sum == 1)
      cout << 0 << endl;
    else {
      int x = 0;
      bool ok = 0;
      for (int i = 1; i <= prime[0]; ++i) {
        while (cnt[i] >= 1) {
          x++;
          cnt[i]--;
          ans *= prime[i];
          if (x >= 2) {
            ok = 1;
            break;
          }
        }
        if (ok) break;
      }
      cout << ans << endl;
    }
  }
}
