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 sieve[10000007];
void computeSieve(int n) {
  for (int i = 4; i <= n; i += 2) {
    sieve[i] = 1;
  }
  for (int i = 3; i <= n; i += 2) {
    if (sieve[i] == 1) continue;
    for (int j = i + i; j <= n; j += i) {
      sieve[j] = 1;
    }
  }
}
long long n;
long long N;
vector<int> factors;
int main() {
  cin >> n;
  N = n;
  computeSieve(10000001);
  int root = sqrt(n);
  for (int i = 2; i <= 10000000; i++) {
    while (sieve[i] == 0 && n % i == 0) {
      factors.push_back(i);
      n /= i;
    }
  }
  if (factors.size() <= 1) {
    cout << 1 << '\n';
    cout << 0 << '\n';
  } else if (factors.size() == 2) {
    cout << 2 << '\n';
  } else {
    cout << 1 << '\n';
    long long product = 1;
    for (int i = 0; i < factors.size() - 2; i++) {
      product *= (long long)factors[i];
    }
    N /= product;
    cout << N << '\n';
  }
  return 0;
}
