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;
bool isPrime(long long number) {
  if (number == 2) return true;
  if (number < 2 || number % 2 == 0) return false;
  for (long long i = 3; i * i <= number; i += 2) {
    if (number % i == 0) return false;
  }
  return true;
}
long long findPrimeDivisor(long long number) {
  vector<long long> primes;
  long long divisor = 0, temp = number;
  for (long long i = 2; i * i <= temp; i += 2) {
    if (temp % i == 0) {
      primes.push_back(i);
      temp /= i;
      if (isPrime(temp)) {
        primes.push_back(temp);
      }
      i = 1;
    }
    if (i == 2) {
      i = 1;
    }
    if (primes.size() >= 2) {
      divisor = primes[0] * primes[1];
      if (divisor == number) return 0;
      return divisor;
    }
  }
  return divisor;
}
long long findWinner(long long number) {
  long long divisor;
  if (number == 1 || isPrime(number)) {
    return 0;
  }
  divisor = findPrimeDivisor(number);
  if (divisor == 0) {
    return 2;
  }
  return divisor;
}
int main() {
  long long q;
  cin >> q;
  long long winner = findWinner(q);
  if (winner != 2) cout << "1" << endl;
  cout << winner;
  return 0;
}
