import sys
import math

N = int(sys.stdin.readline().rstrip("\n"))

count = -1
primes = []
primes.append(2)

for i in range(3, N+1, 2):
    for j in range(3, i, 2):
        if i % j == 0:
            break
    else:
        primes.append(i)
        count += 1

# n = math.factorial(count + 2)

s = 0
for i in range(0, count+1):
    s += math.factorial(count) / (math.factorial(count-i) * math.factorial(i))

sum = 0
for i in range(0, len(primes)):
    for j in range(i, len(primes)):
        sum += primes[j] - primes[i]
        if sum >= 14:
            print(len(primes) - j)
            for k in range(0, len(primes) - j + 1):
                s -= math.factorial(len(primes) - j) / (math.factorial(len(primes) - j - k) * math.factorial(k))
            break
        sum = 0
    sum = 0

print(primes)
print(int(s))