A number is called a mason number, if and only if it can be written to the format like 2^p–1, and it is a prime number. It can be proved that if 2^p–1 is a prime number then p is a prime number. Now your task is that giving you a number, you should judge whether the number is a mason number, and p is a prime number.

Input will consist of a series of number. Each number will appear on a line by itself and it will be less than 2^32.

Output will consist of one line for each number. If the number is a mason number, then output for the number is “It may be a Mason number.”, else is “It must not be a Mason number.”

浙江理工大学第三届ACM程序设计竞赛