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 a[1000010], b[1000], d[10010], p[10010];
long long mn = 1e9, mx = -1e9, ans, cnt, sm = 1, n, m;
bool ok, okk, u[1000010], uu[310][310], uk[1000010];
char ck[510][510], ch[100010];
int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
vector<int> g[900010];
bool is_prime(long long x) {
  for (int i = sqrt(x); i >= 2; i--) {
    if (x % i == 0) {
      if (ans == -1) {
        ans = x / i;
      }
      n /= (x / i);
      return false;
    }
  }
  return true;
}
int main() {
  cin >> n;
  if (n == 1 || is_prime(n)) {
    cout << 1 << endl;
    cout << 0 << endl;
    return 0;
  }
  ans = -1;
  for (;;) {
    cnt++;
    if (is_prime(n)) {
      if (cnt % 2 == 0) {
        cout << 1 << endl;
        ans = max(ans, 0LL);
        cout << ans;
        return 0;
      } else {
        cout << 2;
        return 0;
      }
    }
  }
  return 0;
}
