// Program To Find Prime # From An Entered Array

#include<conio.h>
#include<stdio.h>
#include<iostream.h>

void main(void)
{
	int n,array[5],count=0,total=0;
clrscr();
	cout << "\n\t\t Enter The Range For Array: ";
	cin >> n;
	cout << "\n\t\t == Enter " << n << " Elements For Array ==" << endl;
	for (int i=0;i<n;i++)
	       {
		cout << "\n\t\t\t Enter The Value: ";
		cin >> array[i];
	       }
	for (i=0;i<n;i++)
	       {
		for (int j=2;j<=array[i]/2;j++)
		       {
			if (array[i]%j == 0)
			   {
			    count = 1;
			    break;
			   }
		       }
	if (count == 1)
	       {
		cout << "\n\t\t Number In Array Of Position "<< i+1 << " Is Composite " << array[i];
		count=0;
//		cout << "\n\t\t Total # Of Prime #s: " << total;
	       }
	else
		cout << "\n\t\t Number In Array Of Position "<< i+1 <<" Is Prime " << array[i];
	}
getch();
}