#include <stdio.h>
#include <stdlib.h>
int main ()
{

int n, i, j, *p;

printf ("Enter elements numbber: ");

scanf ("%d", &n);

int numb[n];

p = (int *) malloc (n * sizeof (int));


printf ("Enter elements: ");

for (i = 0; i < n; i++)

    {

scanf ("%d", p + i);

numb[i] = *(p + i);

}

for (i = 0; i < n; i++)
    {

int f = 0;

for (j = 2; j < numb[i]; j++)
	{

if (numb[i] % j == 0)
	    {

f = 1;

}

}

if (f == 0 && numb[i] > 1)
	{

printf ("Prime numbber:%d\n", numb[i]);

}

}

return 0;

}