import math

if __name__ == '__main__':
    n = int(input())

    primes = list(range(n + 1))
    primes[0] = primes[1] = None
    for i in range(2, int(math.sqrt(n)) + 1):
        if primes[i] is None: continue
        for j in range(i * 2, n + 1, i): primes[j] = None
    
    ht = {0 : 0}
    for prime in primes:
        if prime is None: continue

        temp = {}
        for ky in sorted(ht):
            x = ky + prime
            if x > n: break
            if not x in ht or ht[x] < ht[ky] + 1: temp[x] = ht[ky] + 1
        ht.update(temp)
    
    print(ht[n] if n in ht else -1)