public class Sieve {
    public static void main(String args[]) {
		int NUM = Integer.parseInt(args[0]);
		boolean [] flags = new boolean[8192 + 1];
		int count = 0;
		while (NUM-- > 0) {
		    count = 0;
		    for (int i=2; i <= 8192; i++) {
				flags[i] = true;
		    }
		    for (int i=2; i <= 8192; i++) {
				if (flags[i]) {
				    int prime = i;
				    for (int k=i+prime; k <= 8192; k+=prime) {
						flags[k] = false;
				    }
				    count++;
				}
		    }
		}
		System.out.print("Count: " + count + "\n");
    }
}