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;
template <typename T>
string tostr(const T& t) {
  ostringstream os;
  os << t;
  return os.str();
}
long long N;
vector<long long> getfactors(long long n) {
  set<long long> s;
  for (long long i = 1; i * i <= n; ++i) {
    if ((n % i) == 0) {
      if (i != 1 && i != n) s.insert(i);
      long long x = n / i;
      if (x != 1 && x != n) s.insert(x);
    }
  }
  return vector<long long>((s).begin(), (s).end());
}
map<long long, bool> memo;
bool go(int x) {
  vector<long long> f = getfactors(x);
  if ((int)f.size() == 0) {
    return true;
  }
  if (memo.count(x)) return memo[x];
  bool& ref = memo[x];
  bool allWin = true;
  for (int i = (int)(0); i <= (int)((int)f.size() - 1); ++i) {
    bool win = go(f[i]);
    if (!win) {
      allWin = false;
    }
  }
  if (allWin)
    ref = false;
  else
    ref = true;
  return ref;
}
int main() {
  cin >> N;
  vector<long long> f = getfactors(N);
  if ((int)f.size() == 0)
    cout << "0" << endl;
  else {
    bool found = false;
    for (int i = (int)(0); i <= (int)((int)f.size() - 1); ++i) {
      memo.clear();
      bool lose = !go(f[i]);
      if (lose) {
        found = true;
        cout << "1" << endl;
        cout << f[i] << endl;
        break;
      }
    }
    if (!found) cout << "2" << endl;
  }
  return 0;
}
