# include <stdio.h>


int isPrime(int x)
{
	int i;
	for(i=2;i<x/2;i++)
	{
		if(x % i == 0) return 0;
	}
	return 1;
}

int countPrimes(int x[],int size)
{
	int count=0;
	int i;
	for(i=0;i<size;i++)
	{
		if(isPrime(x[i])) count++;
	}
	return count;
}

int main()
{
  int x[10]={12,9,7,6,5,11,19,21,23,29};
 int k = countPrimes(x,10);
 printf("Primes are %d \n",k);
  return 0;
}