import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        boolean[] isNotPrime = new boolean[n + 1];
        TreeMap<Integer, Integer> counts = new TreeMap<>();
        counts.put(0, 0);
        for (int i = 2; i <= n; i++) {
            if (isNotPrime[i]) {
                continue;
            }
            for (int j = 2; j * i <= n; j++) {
                isNotPrime[i * j] = true;
            }
            Integer key = n - i + 1;
            while ((key = counts.lowerKey(key)) != null) {
                if (!counts.containsKey(key + i) || counts.get(key + i) <= counts.get(key)) {
                    counts.put(key + i, counts.get(key) + 1);
                }
            }
        }
        System.out.println(counts.getOrDefault(n, -1));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}