import java.io.InputStream;
import java.util.Scanner;

public class Main {
	private static boolean isPrime(int x) {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	}

	public static int countPrimes(InputStream ins) {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	}

	public static  void main (String[] args) throws Exception {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	}
} import java.io.InputStream; InputStream java.io import java.util.Scanner; Scanner java.util public class Main {
	private static boolean isPrime(int x) {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	}

	public static int countPrimes(InputStream ins) {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	}

	public static  void main (String[] args) throws Exception {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	}
} Main private static boolean isPrime(int x) {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	} isPrime {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	} if (x == 1) { return  false;} x == 1 x 1 { return  false;} return  false; false if (x == 2) { return true;} x == 2 x 2 { return true;} return true; true if (x % 2==0) { return false;} x % 2==0 x % 2 x 2 0 { return false;} return false; false for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		} int i = 3; int i = 3; i 3 i < Math.sqrt(x)+1 i Math.sqrt(x)+1 Math.sqrt(x) Math.sqrt Math x 1 i++ i++ i {
			if (x % i == 0) {
				return false;
			}
		} {
			if (x % i == 0) {
				return false;
			}
		} if (x % i == 0) {
				return false;
			} x % i == 0 x % i x i 0 {
				return false;
			} return false; false return true; true int x x public static int countPrimes(InputStream ins) {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	} countPrimes {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	} Scanner sc = new Scanner(ins); sc new Scanner(ins) int numOfList = sc.nextInt(); numOfList sc.nextInt() sc.nextInt sc int primes = 0; primes 0 for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		} int i = 0; int i = 0; i 0 i < numOfList i numOfList i++ i++ i {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		} {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		} int num = sc.nextInt(); num sc.nextInt() sc.nextInt sc if (isPrime(num)) {
				primes++;
			} isPrime(num) isPrime num {
				primes++;
			} primes++ primes return primes; primes InputStream ins ins public static  void main (String[] args) throws Exception {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	} main {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	} int primes = countPrimes(System.in); primes countPrimes(System.in) countPrimes System.in System System.in System.out.println(primes) System.out.println System.out System System.out primes String[] args args public class Main {
	private static boolean isPrime(int x) {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	}

	public static int countPrimes(InputStream ins) {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	}

	public static  void main (String[] args) throws Exception {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	}
} public class Main {
	private static boolean isPrime(int x) {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	}

	public static int countPrimes(InputStream ins) {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	}

	public static  void main (String[] args) throws Exception {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	}
} Main
import java.io.InputStream;
import java.util.Scanner;

public class Main {
	private static boolean isPrime(int x) {

		// Eratosthenes sieve

		if (x == 1) { return  false;}
		if (x == 2) { return true;}
		if (x % 2==0) { return false;}

		for (int i = 3; i < Math.sqrt(x)+1; i++) {
			if (x % i == 0) {
				return false;
			}
		}
		return true;
	}

	public static int countPrimes(InputStream ins) {
		Scanner sc = new Scanner(ins);
		int numOfList = sc.nextInt();

		int primes = 0;
		for (int i = 0; i < numOfList; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				primes++;
			}
		}
		return primes;
	}

	public static  void main (String[] args) throws Exception {
		int primes = countPrimes(System.in);
		System.out.println(primes);
	}
}