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 int q;
vector<int> prime, fector;
bool ara[10000000];
void makevector(int q) {
  for (int i = 0; i < q; i++) {
    if (ara[i]) prime.push_back(i);
  }
}
void makeprime(int q) {
  int n = sqrt(q) + 1;
  ara[0] = false;
  ara[1] = false;
  for (int i = 4; i < q; i += 2) {
    ara[i] = false;
  }
  for (int i = 3; i < n; i += 2) {
    if (ara[i]) {
      for (int j = i * i; j < q; j += i) ara[j] = false;
    }
  }
  makevector(q);
}
bool isprime(long long int q) {
  for (int i = 0; i < prime.size(); i++) {
    if (q % prime[i] == 0) return false;
  }
  return true;
}
void makefector(long long int q) {
  for (int i = 0; i < prime.size() || q > 1;) {
    if (q % prime[i] == 0) {
      q = q / prime[i];
      fector.push_back(prime[i]);
    } else if (i == prime.size() - 1 && q != 1) {
      fector.push_back(q);
    } else
      i++;
    if (fector.size() > 2) return;
  }
  return;
}
int main() {
  memset(ara, true, sizeof(ara));
  cin >> q;
  makeprime(2 * sqrt(q) + 1);
  if (isprime(q) || q == 1 || q == 2 || q == 3) {
    cout << "1" << endl;
    cout << "0" << endl;
    return 0;
  }
  makefector(q);
  if (fector.size() == 2)
    cout << "2" << endl;
  else {
    cout << "1" << endl;
    cout << fector[0] * fector[1] << endl;
  }
  return 0;
}
