2000 LSU Computer Science High School Programming Contest
Novice Problem 1: Divisibility

MAIN
  Home
  Schedule
  Rules
  Compile

RESULTS
  Results

PROBLEMS
  Novice
  Veteran
  All

  

Many times it is useful to know what divisors a number has. You have been requested to help determine divisors for a bunch of numbers.

Common divisors that show up frequently are 2, 3, 4, 5, 6, 8, and 9. In fact, numbers that are divisible by at least 4 of these 7 divisors are considered easily divisible.

Your job is to read a series of numbers and determine if they are easy.

Input

Input will consist of one positive integer per line. You continue should processing until you encounter a 0.

Output

You are to output each number and tell if it is easy (see the sample output below). Spacing is not significant. There must be at least one space between each number/word. Each line of input should generate one line of output.

Sample Input

24
17
30
36

Sample Output

24 is easy.
17 is not easy.
30 is easy.
36 is easy.



The statements and opinions included in these pages are those of the LSU Computer Science High School Programming Contest Staff only. Any statements and opinions included in these pages are not those of Louisiana State University or the LSU Board of Supervisors.

© 2000 LSU Computer Science High School Programming Contest

This page last updated 2001/04/05 20:28:48.