采用队列//滑动窗口思路。
import queue
def is_prime(n:int):
for i in range(2, n-1):
if n % i == 0:
return 0
return 1
n = int(input())
count = is_prime(n)
primes = queue.Queue()
sum_ = 0
for i in range(n-1,1,-1):
if is_prime(i) == 1:
primes.put(i)
if sum_ + i < n:
sum_ += i
else:
if sum_ + i == n:
count += 1
sum_ = sum_ + i - primes.get()
print(count)