// Arup Guha
// 1/23/2012
// Written in COP 3330 (Stephen Fulwider's Class)
// Checks if an integer entered is prime or not.

import java.util.*;

public class prime {


	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);

		// Get the user input.
		System.out.println("Please enter an integer.");
		int number = stdin.nextInt();

		boolean isPrime = true;

		// Special case - all primes are >= 2
		if (number < 2) {
			isPrime = false;
		}

		// Try each possible divisor.
		for (int i=2; i<number; i++) {

			// We found one; the number isn't prime.
			if (number%i == 0) {
				isPrime = false;
				break;
			}
		}

		// Print out the final result.
		if (isPrime) {
			System.out.println(number+" is prime.");
		}
		else {
			System.out.println(number+" is NOT prime.");
		}

	}
}