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 long long INF = 1e6 + 5;
const long long MAX = 1e7 + 5;
const double pi = 3.14159265359;
bitset<10000007> bs;
vector<long long> prims;
void sieve(long long n) {
  bs.set();
  bs[0] = 0;
  bs[1] = 0;
  for (long long i = 2; i < n; i++) {
    if (bs[i]) {
      prims.push_back(i);
      for (long long j = i * i; j < n; j += i) bs[j] = 0;
    }
  }
}
bool isPrime(long long a) {
  if (a < 10000000) return bs[a];
  long long b = sqrt(a) + 2;
  for (int i = 0; i < prims.size(); i++) {
    if (prims[i] > b)
      return true;
    else if (a % prims[i] == 0)
      return false;
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long n;
  cin >> n;
  sieve(10000000);
  if (isPrime(n) || n == 1) {
    return cout << 1 << "\n" << 0, 0;
  }
  vector<long long> pr;
  int i = 0;
  while (n > 1) {
    long long div = prims[i++];
    while (n > 1 && n % div == 0) {
      n /= div;
      pr.push_back(div);
    }
    if (i == (int)prims.size()) {
      pr.push_back(n);
      break;
    }
  }
  if (pr.size() == 2) {
    cout << 2;
  } else {
    cout << 1 << endl;
    cout << pr[0] * pr[1];
  }
}
