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;
const long long int mod = 1000000007;
void __print(long long int x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  long long int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void primeFactorization(long long int n, map<long long int, long long int> &m) {
  while (n % 2 == 0) {
    m[2]++;
    n /= 2;
  }
  for (long long int i = 3; i * i <= n; i += 2) {
    if (n % i == 0) {
      m[i]++;
      n /= i;
    }
  }
  if (n > 2) {
    m[n]++;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  map<long long int, long long int> m;
  primeFactorization(n, m);
  if (n == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  long long int total = 0;
  for (auto it = m.begin(); it != m.end(); it++) {
    total += it->second;
  }
  if (total == 1) {
    cout << 1 << endl;
    cout << 0 << endl;
  } else if (total == 2) {
    cout << 2 << endl;
  } else {
    auto beg = m.begin();
    cout << 1 << endl;
    if (m.size() == 1) {
      cout << beg->first * beg->first << endl;
    } else {
      long long int ans = beg->first;
      beg++;
      ans *= beg->first;
      cout << ans << endl;
    }
  }
}
