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;
vector<pair<long long, long long> > do_it(long long n) {
  vector<pair<long long, long long> > res;
  if (n % 2 == 0) {
    long long cnt = 0;
    while (n % 2 == 0) n /= 2, cnt++;
    res.push_back(make_pair(2, cnt));
  }
  for (long long i = 3; i * i <= n; i += 2) {
    if (n % i == 0) {
      long long cnt = 0;
      while (n % i == 0) {
        n /= i, cnt++;
      }
      res.push_back(make_pair(i, cnt));
    }
  }
  if (n != 1) {
    res.push_back(make_pair(n, 1));
  }
  return res;
}
int main(void) {
  long long q;
  cin >> q;
  vector<pair<long long, long long> > res = do_it(q);
  long long sum = 0;
  if (q == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  for (long long i = 0; i < res.size(); i++) sum += res[i].second;
  if (sum == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
  } else if (sum == 2) {
    cout << 2 << endl;
  } else {
    cout << 1 << endl;
    long long tot = 1, cnt = 0;
    long long k = 0;
    while (k < res.size() && cnt <= sum - 2) {
      if (cnt + res[k].second < sum - 2) {
        for (long long z = 0; z < res[k].second; z++) tot *= res[k].first;
        k++;
      } else if (cnt + res[k].second == sum - 2) {
        for (long long z = 0; z < res[k].second; z++) tot *= res[k].first;
        k++;
        break;
      } else if (cnt + res[k].second > sum - 2) {
        for (long long z = 0; z < sum - 2 - cnt; z++) tot *= res[k].first;
        break;
      }
    }
    cout << q / tot << endl;
  }
  return 0;
}
