#include <iostream>
using namespace std;
int main()
{
    int i,n = 33;
    bool isprime= true;
    // 0 and 1 are not prime numbers also, negative numbers are not prime
    if(n < 2)
    {
        isprime = false;
    }
    else
    {
    // running loop till n is wasteful because for any number n the numbers in
    // the range(n/2 + 1, n) won't be divisible anyways.
        for(i=2; i < n/2; i++)
        {
            if(n % i == 0)
            {
                isprime = false;
                break;
            }
        }
    }
    string result = isprime ? "Prime":"not Prime";
    cout<<"The number " << n << " is : " << result;
    return 0;
}