Zenyk's Magic Tricks
Limits: 2 sec., 256 MiB
This statement was translated automatically from Ukrainian.
Zenyk loves magic tricks very much. Today he came to the regional Olympiad to entertain the participants before the start of the competition.
Zenyk’s favorite trick consists of as many as 10 steps:
Asks someone to think of a number \(x\) and say it.
Squares \(x\).
Adds the number 4 to the result.
Multiplies the result by 14.
Divides by 7.
Subtracts 8.
Multiplies by 50.
Takes the square root.
Adds 47.
Subtracts \(10 \cdot x\).
So many actions — it’s enough to make your head spin.
At the end of the trick, Zenyk proudly says the number \(y\) — the result of all operations.
But alas, Zenyk drank too much juice before the trick. He has doubts whether he made a mistake somewhere.
Help him and tell him if his trick was successful.
Input
The single line contains two integers \(x\) and \(y\) — the initial number and the result of Zenyk’s trick.
Output
In a single line, print Magic if Zenyk’s trick worked,
or Too much juice otherwise.
Note that the output should not contain any extra information and must strictly match the format described in this section of the problem statement.
Constraints
\(0 \le x, y \le 10^3\).
Samples
| Input (stdin) | Output (stdout) |
|---|---|
| 47 47 | Magic |
| Input (stdin) | Output (stdout) |
|---|---|
| 4 7 | Too much juice |
| Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
|---|