C++ prime find prime number using exhaustive enumeration

prime_number.c++

#include <iostream>
using namespace std;

namespace lablnet {
	bool is_prime(int n)
	{
		bool isPrime = true;
		for (int i = n - 1; i >= 2; i--)
		{
			if (n % i == 0)
			{
				isPrime = false;
				break;
			}
		}

		return isPrime;
	}
}


int main()
{
	bool isPrime = true;
	int n;
	cout << "Enter a positive integer \t";
	cin >> n;
	if (lablnet::is_prime(n))
		cout << "This is a prime number";
	else
		cout << "This is not a prime number";

	return 1;
}