//Xinnuo Wang                   CS1A                   Chapter6 Page.375 #21
/*******************************************************************************
 * 
 * Determine an interger is prime
 * _____________________________________________________________________________
 * The program accept an integer and determine it's prime or not.
 * 
 * _____________________________________________________________________________
 * Input
 *    num    : The accepted integer
 * Output
 *    t      : True, reperesent the interger is prime
 *    f      : Fslse,reperesent the interger isn't prime
 * ****************************************************************************/
#include <iostream>
using namespace std;
bool isPrime(int num);
int main() 
{
	int num;
	cout << " Enter an integer" << endl;
	cin>> num;
	cout << isPrime(num);
	return 0;
}
bool isPrime(int num)
{
	for (int i = 2; i< num; i++)
	{
		if (num % i == 0)
		return false;
	}
	return true;
	
}