To fend off the attacks of the vampire Count Kim Sang-geun, you must memorize an equation of the following form.
$$\left(\frac{a}{b}\right)^3 + \left(\frac{c}{b}\right)^3 = n$$
Here $a$, $b$, $c$, and $n$ are all natural numbers. For example, when $n = 9$ the following equation holds.
(415280564497/348671682660)^3 + (676702467503/348671682660)^3 = 9
But an equation this long cannot be memorized before the Count strikes and turns you into a vampire. Fortunately, for the same $n = 9$ there is a far shorter equation.
(2/1)^3 + (1/1)^3 = 9
Given a natural number $n$, write a program that finds the equation that is easiest to memorize. The easiest-to-memorize equation is the one that minimizes $a + b + c + b$, subject to $\frac{a}{b} \ge \frac{c}{b}$ (that is, $a \ge c$). The equation satisfying these conditions is always unique. If no equation has $a + b + c + b$ smaller than $4000$, print No value..
The input consists of several test cases. Each line contains one natural number $n$ smaller than $10000$. The last line contains a single $0$, which is not processed.
For each test case, print the easiest-to-memorize equation on its own line. Print exactly one space before and after each + and = sign. If no valid equation exists, print No value..