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 int N = 100009;
const int sq = 3200009;
int vis[sq + 5];
long long sieve(long long n) {
  int k = 0;
  long long ans = 1;
  for (int i = 4; i <= sq; i += 2) vis[i] = 1;
  if (n % 2 == 0 && n != 2) {
    k++;
    ans = ans * 2;
  }
  if (n % 4 == 0) {
    ans = 4;
    return ans;
  }
  for (long long i = 3; i <= sq; i += 2) {
    if (vis[i] == 0) {
      if (n % (i * i) == 0) return i * i;
      if (n % i == 0 && n != i) {
        k++;
        ans = ans * i;
        if (k == 2) return ans;
      }
      for (long long j = i + i; j <= sq; j += i) {
        vis[j] = 1;
      }
    }
  }
  if (k == 0) return 0;
  return -1;
}
int main() {
  long long n, num;
  scanf("%I64d", &n);
  num = sieve(n);
  if (num == -1 || num == n) {
    printf("2\n");
  } else {
    printf("1\n%I64d\n", num);
  }
  return 0;
}
