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
import operator
from functools import reduce


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def sqrt(n):
    low, high = 1, 10**7
    while low < high:
        mid = (low+high)//2
        if mid**2 > n:
            high = mid
        else:
            low = mid+1
    return low


def first_divisor(q, include_self=False):
    for i in range(2, sqrt(q)):
        if q%i == 0:
            return i, q//i
    return 1, q


def solve():
    q = read_int()
    d0, q0 = first_divisor(q)
    if d0 != 1:
        d1, q1 = first_divisor(q0)
        if d1 != 1:
            print(1)
            print(d0*d1)
        else:
            print(2)
    else:
        print(1)
        print(0)


if __name__ == '__main__':
    solve()
