// Returns the next prime number >= n
#include <math.h>
#include <stream.h>
int nextPrime (int  n)
{


for (int size = n; ; size++)
{
    int notPrime = 0;
    int ceilsqrt = ceil( sqrt(size));
//    cout << " size, sqrt: " << size << " " << ceilsqrt << endl;

    for ( int i = 2 ; i <= ceilsqrt;  i++)
    {
	int div = size/i;
	if (div*i == size)
	    notPrime = 1;
	if (notPrime) break;
    }
    if (notPrime == 0)
	return(size);
}
	
}