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>
#pragma GCC optimize("O2")
using namespace std;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
map<long long int, long long int> mp;
int main() {
  fastio();
  int tc = 1;
  while (tc--) {
    long long int n;
    cin >> n;
    long long int uk = n;
    long long int cnt = 0;
    for (long long int i = 2; i * i <= uk; i++) {
      while (uk % i == 0) {
        mp[i]++;
        uk /= i;
        cnt++;
      }
    }
    if (n > 1) {
      mp[n]++;
      cnt++;
    }
    if (cnt <= 2) {
      cout << 1;
      cout << "\n";
      ;
      cout << 0;
    } else {
      if (mp.size() == 1) {
        if (cnt == 3) {
          cout << 2;
        } else if (cnt & 1) {
          cout << 1;
          cout << "\n";
          ;
          long long int p = 1;
          long long int val;
          for (auto i : mp) val = i.first;
          for (int i = 0; i < (3); i++) p *= val;
          cout << p;
        } else {
          if (cnt == 6)
            cout << 2;
          else {
            cout << 1;
            long long int p = 1;
            long long int val;
            for (auto i : mp) val = i.first;
            for (int i = 0; i < (3); i++) p *= val;
            cout << p;
          }
        }
      } else if (mp.size() == 2) {
        set<int> s;
        for (auto i : mp) {
          s.insert(i.second);
        }
        if (s.size() == 1)
          cout << 2;
        else {
          cout << 1;
          cout << "\n";
          ;
          cout << *s.begin() * (*prev(s.end()));
        }
      } else {
        long long int val = 1;
        long long int u = 1;
        for (auto i : mp) {
          if (u == 3) break;
          val *= i.first;
          u++;
        }
        cout << 1;
        cout << "\n";
        ;
        cout << val;
      }
    }
  done:;
  }
  return 0;
}
