Mersenne Composite Numbers

Time Limit: Java: 2000 ms / Others: 2000 ms

Memory Limit: Java: 65536 KB / Others: 65536 KB

Description

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" - GIMPS - striving to find ever-larger prime numbers by examining a particular category of such numbers.

A Mersenne number is defined as a number of the form (2p - 1), where p is a prime number - a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number - referred to as its prime factors.)

Initially it looks as though the Mersenne numbers are all primes.

PrimeCorresponding Mersenne Number
24-1 = 3 -- prime
38-1 = 7 -- prime
532-1 = 31 -- prime
7128-1 = 127 -- prime

If, however, we are having a "Grand Internet" search, that must not be the case.

Where k is an input parameter, compute all the Mersenne composite numbers less than 2k - where k

Input

Input contains a single number, without leading or trailing blanks, giving the value of k. As promised, k

Output

One line per Mersenne composite number giving first the prime factors (in increasing order) separate by asterisks, an equal sign, the Mersenne number itself, an equal sign, and then the explicit statement of the Mersenne number, as shown in the sample output. Use exactly this format. Note that all separating white space fields consist of one blank.


Sample Input

31

Sample Output

23 * 89 = 2047 = ( 2 ^ 11 ) - 1
47 * 178481 = 8388607 = ( 2 ^ 23 ) - 1
233 * 1103 * 2089 = 536870911 = ( 2 ^ 29 ) - 1

Hint

None

Source

Pacific Northwest 2004

提交代码