PROGRAMMING:Even complete
A number P is even complete if and only if it has the following form: $$p = 2 ^ {n-1} (2 ^ n-1) $$, where $$2 ^ n-1 $$is prime.
[popular science] perfect numbers, also known as perfect numbers or perfect numbers, are some special natural numbers: the sum of all its true factors (i.e. divisors other than itself) is exactly equal to itself. An even number is complete if and only if it has the following form: $$p = 2 ^ {n-1} (2 ^ n-1) $$, where $$2 ^ n-1 $$is prime. The sufficiency of this fact is proved by Euclid, while the necessity is proved by Euler.
Perfect numbers are very rare. The first ten known perfect numbers are as follows
6 (1), 28 (2), 496 (3), 8128 (4), 33550336 (8), 8589869056 (10), 137438691328 (12), 2305843008139952128 (19), 2658455991569831744654692615953842176 (37), 1915619426082361072947933780843036383130997321548169216 (54).
At present, there are two puzzles in the study of perfect numbers. One is whether odd perfect numbers exist; The other is whether there are infinite perfect numbers.
Please program to output the nth (n < = 8) even perfect number P, and the corresponding multiplication formula in the form of $$p = 2 ^ {n-1} * (2 ^ n-1) $.
Note that the data type should use signed long long.
###Input example:
```in
one
```
###Output example:
```out
6=2*3
```
###Input example:
```in
eight
```
###Output example:
```out
2305843008139952128=1073741824*2147483647
```
answer：If there is no answer, please comment
[popular science] perfect numbers, also known as perfect numbers or perfect numbers, are some special natural numbers: the sum of all its true factors (i.e. divisors other than itself) is exactly equal to itself. An even number is complete if and only if it has the following form: $$p = 2 ^ {n-1} (2 ^ n-1) $$, where $$2 ^ n-1 $$is prime. The sufficiency of this fact is proved by Euclid, while the necessity is proved by Euler.
Perfect numbers are very rare. The first ten known perfect numbers are as follows
6 (1), 28 (2), 496 (3), 8128 (4), 33550336 (8), 8589869056 (10), 137438691328 (12), 2305843008139952128 (19), 2658455991569831744654692615953842176 (37), 1915619426082361072947933780843036383130997321548169216 (54).
At present, there are two puzzles in the study of perfect numbers. One is whether odd perfect numbers exist; The other is whether there are infinite perfect numbers.
Please program to output the nth (n < = 8) even perfect number P, and the corresponding multiplication formula in the form of $$p = 2 ^ {n-1} * (2 ^ n-1) $.
Note that the data type should use signed long long.
###Input example:
```in
one
```
###Output example:
```out
6=2*3
```
###Input example:
```in
eight
```
###Output example:
```out
2305843008139952128=1073741824*2147483647
```
answer：If there is no answer, please comment