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;
long long n, N;
int has[3200009], prime[3200009];
void calc(int p) {
  fill(prime + 1, prime + 3200009, 1);
  prime[0] = prime[1] = 0;
  for (int i = 2; i * i <= p; i++) {
    if (prime[i]) {
      for (int j = i * i; j <= p; j += i) prime[j] = 0;
    }
  }
}
bool check(long long p) {
  if (p == 0 || p == 1 || p == 2) return true;
  for (int i = 2; i * i <= p; i++)
    if (p % i == 0) return false;
  return true;
}
int main() {
  scanf("%I64d", &n);
  N = n;
  if (check(n)) {
    cout << 1 << "\n" << 0;
    return 0;
  }
  calc(3200000);
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) {
        n /= i;
        has[i] = 1;
      }
    }
  }
  if (n > 1) has[n] = 1;
  for (int i = 1; i <= 3200000; i++)
    if (has[i] && !prime[i]) {
      cout << 2;
      return 0;
    }
  cout << 1 << "\n";
  for (int i = 1; i <= 3200000; i++)
    if (has[i]) {
      cout << N / i;
      return 0;
    }
}
