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;
bool num[4000000];
long long primes[4000000];
void siv() {
  long long d = 0;
  primes[d++] = 2;
  for (long long i = 3; i < 4000000; i += 2) {
    if (!num[i]) {
      primes[d++] = i;
      for (long long j = i * i; j < 4000000; j += (2 * i)) num[j] = 1;
    }
  }
}
vector<long long> s;
void prime_fact(long long x) {
  long long lim = sqrt(x);
  for (long long i = 0; primes[i] <= lim; i++) {
    if (x % primes[i] == 0) {
      long long j = 0;
      while (x % primes[i] == 0) {
        x /= primes[i];
        j++;
      }
      s.push_back(primes[i]);
      s.push_back(j);
      lim = sqrt(x);
    }
  }
  if (x > 1) {
    s.push_back(x);
    s.push_back(1);
  }
}
int main() {
  siv();
  long long q;
  scanf("%I64d", &q);
  prime_fact(q);
  if (q == 1)
    printf("1\n0\n");
  else {
    if (s.size() == 2) {
      if (s[1] == 1) {
        printf("1\n0\n");
      } else if (s[1] == 2) {
        printf("2\n");
      } else {
        printf("1\n");
        printf("%I64d\n", s[0] * s[0]);
      }
    } else if (s.size() == 4) {
      if (s[1] == 1 && s[3] == 1)
        printf("2\n");
      else {
        printf("1\n");
        printf("%I64d\n", s[0] * s[2]);
      }
    } else {
      printf("1\n");
      printf("%I64d\n", s[0] * s[2]);
    }
  }
}
