/*
Write a program to read a positive integer N. 
If N is not a positive integer > 1 display "Invalid Integer". 
If N is a positive integer > 1, display the largest non-trivial positive divisor of N. 
If N is prime (has no nontrivial positive divisors), print N is prime.
This program is with repetition.
*/
#include <iostream>
using namespace std;
int main()
{
	int i, n, m;
	bool non_trivial_divisors;
	char ch = 'Y';

	while (toupper(ch) == 'Y')
    {
		system("cls");
		cout << "Enter a pos. integer > 1: ";
		cin >> n;
		if (n > 1)
		{
			non_trivial_divisors = false;
			for (i = 2; i < n; i++)
				if (n % i == 0)
				{
					non_trivial_divisors = true;
					m = i;
				}
			if (non_trivial_divisors) 
	// Same as if (non_trivial_divisors == true)
				cout << "The largest nontrivial positive divisor of " 
					<< n << " is " << m << ".\n";
			else
				cout << n << " is prime.\n";
		}
		else
			cout << "The number should be > 1.\n";

		cout << "Continue? If yes, press y or Y: ";
		cin >> ch;
	}

	return 0;
}