def sieve(n):
    is_prime = [True for _ in range(n+1)]
    is_prime[0] = False

    for i in range(2, n+1):
        if is_prime[i-1]:
            j = 2 * i
            while j <= n:
                is_prime[j-1] = False
                j += i
    table = [ i for i in range(1, n+1) if is_prime[i-1]]
    return is_prime, table

N = int(input())
_, table = sieve(N)

dp = [[-float('inf')] * (N + 1) for _ in range(len(table) + 1)]
dp[0][0] = 0
for i in range(len(table)):
  a  = table[i]
  for j in range(N + 1):
    dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
    if j + a <= N:
      dp[i + 1][j + a] = max(dp[i + 1][j + a], dp[i][j] + 1)
if dp[-1][-1] < 0:
  print(-1)
else:
  print(dp[-1][-1])