import java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		}

		System.out.println(cnt);
	}

	private static boolean isPrime(int x) {
		if (x == 2) {
			return true;
		}

		if (x < 2 || x % 2 == 0) {
			return false;
		}

		int i = 3;

		while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		}
		return true;
	}
} import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		}

		System.out.println(cnt);
	}

	private static boolean isPrime(int x) {
		if (x == 2) {
			return true;
		}

		if (x < 2 || x % 2 == 0) {
			return false;
		}

		int i = 3;

		while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		}
		return true;
	}
} Main public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		}

		System.out.println(cnt);
	} main {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		}

		System.out.println(cnt);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int cnt = 0; cnt 0 for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		} {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		} int num = sc.nextInt(); num sc.nextInt() sc.nextInt sc if (isPrime(num)) {
				cnt++;
			} isPrime(num) isPrime num {
				cnt++;
			} cnt++ cnt System.out.println(cnt) System.out.println System.out System System.out cnt String args[] args private static boolean isPrime(int x) {
		if (x == 2) {
			return true;
		}

		if (x < 2 || x % 2 == 0) {
			return false;
		}

		int i = 3;

		while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		}
		return true;
	} isPrime {
		if (x == 2) {
			return true;
		}

		if (x < 2 || x % 2 == 0) {
			return false;
		}

		int i = 3;

		while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		}
		return true;
	} if (x == 2) {
			return true;
		} x == 2 x 2 {
			return true;
		} return true; true if (x < 2 || x % 2 == 0) {
			return false;
		} x < 2 || x % 2 == 0 x < 2 x 2 x % 2 == 0 x % 2 x 2 0 {
			return false;
		} return false; false int i = 3; i 3 while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		} i <= Math.sqrt(x) i Math.sqrt(x) Math.sqrt Math x {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		} if (x % i == 0) {
				return false;
			} x % i == 0 x % i x i 0 {
				return false;
			} return false; false i = i + 2 i i + 2 i 2 return true; true int x x public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		}

		System.out.println(cnt);
	}

	private static boolean isPrime(int x) {
		if (x == 2) {
			return true;
		}

		if (x < 2 || x % 2 == 0) {
			return false;
		}

		int i = 3;

		while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		}
		return true;
	}
} public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		}

		System.out.println(cnt);
	}

	private static boolean isPrime(int x) {
		if (x == 2) {
			return true;
		}

		if (x < 2 || x % 2 == 0) {
			return false;
		}

		int i = 3;

		while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		}
		return true;
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int cnt = 0;
		for (int i = 0; i < n; i++) {
			int num = sc.nextInt();
			if (isPrime(num)) {
				cnt++;
			}
		}

		System.out.println(cnt);
	}

	private static boolean isPrime(int x) {
		if (x == 2) {
			return true;
		}

		if (x < 2 || x % 2 == 0) {
			return false;
		}

		int i = 3;

		while (i <= Math.sqrt(x)) {
			if (x % i == 0) {
				return false;
			}
			i = i + 2;
		}
		return true;
	}
}