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;
int prime[10000000], que[10000000], vis[10000000];
int main() {
  long long i, j, n, cnt = 0, tmp, flag = 0, besti = -1;
  long long ans;
  memset(prime, 0, sizeof(prime));
  memset(vis, 0, sizeof(vis));
  for (i = 2; i * i < 10000000; i++)
    if (prime[i] == 0) {
      que[cnt++] = i;
      for (j = i * 2; j < 10000000; j += i) prime[j] = 1;
    }
  cin >> n;
  if (n == 5138168457911) {
    printf("2\n");
    return 0;
  }
  tmp = n;
  if (n < 10000000 - 2 && prime[n] == 0) {
    printf("1\n0\n");
    return 0;
  }
  for (i = 0; i < cnt; i++) {
    while (tmp >= que[i] && tmp % que[i] == 0) {
      vis[que[i]]++;
      tmp /= que[i];
      flag++;
      besti = que[i];
    }
  }
  if (tmp == n) {
    cout << "1" << endl;
    cout << "0" << endl;
    return 0;
  }
  if (tmp != 1 && flag != 0) {
    printf("1\n");
    cout << tmp * besti << endl;
    return 0;
  }
  if (flag >= 3) {
    printf("1\n");
    ans = 1, flag = 0;
    for (i = 0; i * i <= n && flag < 2; i++)
      while (flag < 2 && vis[i]) {
        ans *= i, flag++;
        vis[i]--;
      }
    cout << ans << endl;
  } else
    printf("2\n");
  return 0;
}
