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 mark[3200000];
int prime[3200000];
int cnt = 0;
void Init() {
  int i, j, q, n;
  memset(mark, 0, sizeof(mark));
  n = 3200000;
  for (i = 2; i <= n; i++) {
    if (mark[i] == 0) {
      prime[cnt++] = i;
    }
    for (j = 0; j < cnt; j++) {
      if (prime[j] * i > n) break;
      mark[prime[j] * i] = prime[j];
      if (mark[i] == prime[j]) break;
    }
  }
}
int main() {
  Init();
  long long n;
  int i;
  while (cin >> n) {
    int ans = 0;
    long long res = 1;
    for (i = 0; i < cnt && prime[i] <= n; i++) {
      while (n % prime[i] == 0) {
        ans++;
        if (ans <= 2) res *= prime[i];
        n /= prime[i];
      }
    }
    if (n != 1) {
      ans++;
      if (ans <= 2) res *= prime[i];
    }
    if (ans == 0) {
      puts("1\n0");
    } else if (ans >= 3) {
      cout << "1\n" << res << endl;
    } else
      puts("2");
  }
  return 0;
}
