#include <stdio.h>

int isPrimeNumber(int target_number);
 
int main ( void ) {
	int target_number = 0;
	int loop = 0;
	int Max_number = 0;
	int number_of_prime_numbers = 0;
	int flag_not_prime_number = 0;
	
	scanf ( "%d", &Max_number );
	for ( loop = 0; loop < Max_number; loop++ ) {
		scanf ( "%d", &target_number );
		flag_not_prime_number = isPrimeNumber(target_number);
		 
		if ( flag_not_prime_number == 0 ) {
			number_of_prime_numbers++;
		}
	}
	printf("%d\n", number_of_prime_number);
	return 0;
}

int isPrimeNumber(int target_number)
{
	
	int flag_not_prime_number = 0;
	int divisor = 2;
	
	
	if ( target_number == 4 ) {
		flag_not_prime_number = 1;
	}
	 
	while ( divisor*divisor <= target_number ) {
		if ( target_number % divisor == 0 ) {
			flag_not_prime_number = 1;
			break;
		}
		divisor++;
	}
	return flag_not_prime_number = 1;
}
