#!/usr/bin/env python
#
# Check numbers for being prime
# Author:  Yotam Medini  yotam.medini@gmail.com -- Created: 2010/June/18

import sys

# Return True if n is prime, otherwise, return False
def is_prime(n):
    ret = (n > 1) # 1 is not prime
    d = 2
    # Enough to check  divisors  d  until  d*d <= n
    while ret and d * d <= n:
        ret = ((n % d) != 0) # If True, d divides n, leave the loop!
        d += 1
    return ret


if len(sys.argv) == 1:
    sys.stderr.write("Usage: %s <numbers...>\n" % sys.argv[0])
    sys.exit(1)


ai = 1
while ai < len(sys.argv):
    n = int(sys.argv[ai])
    is_isnot = "is not"
    if is_prime(n):
        is_isnot = "is"
    sys.stdout.write("%d %s a prime number\n" % (n, is_isnot))
    ai += 1
sys.exit(0)