(* prime.pas - Practice with if and loop to see if a number is prime.
 * Ask the user for n.  Count its divisors.  If exactly 2, it's prime.
 * The largest prime "integer" is 32749.
 *)

program prime;

var
  n, count, divisor : integer;

begin

  write('Enter a positive integer:  ');
  readln(n);
  writeln('You entered ', n);

  (* Start count at 0.  The divisor goes from 1 to n, inclusive.  *)
  count := 0;
  divisor := 1;
  
  while divisor <= n do
    begin
      if n mod divisor = 0 then
        count := count + 1;
      divisor := divisor + 1;
    end;

  if count = 2 then
    writeln(n, ' is prime.')
  else
    writeln(n, ' is not prime.');

end.