Wet Shark asked Rat Kwesh to generate three positive real numbers $*x*$, $*y*$ and $*z*$, from $0.1$ to $200.0$, inclusive. Wet Krash wants to impress Wet Shark, so all generated numbers will have exactly one digit after the decimal point.
Wet Shark knows Rat Kwesh will want a lot of cheese. So he will give the Rat an opportunity to earn a lot of cheese. He will hand the three numbers $*x*$, $*y*$ and $*z*$ to Rat Kwesh, and Rat Kwesh will pick one of the these twelve options:
$*a*_{1} = *x*^{*y*^{*z*}}$;$*a*_{2} = *x*^{*z*^{*y*}}$;$*a*_{3} = (*x*^{*y*})^{*z*}$;$*a*_{4} = (*x*^{*z*})^{*y*}$;$*a*_{5} = *y*^{*x*^{*z*}}$;$*a*_{6} = *y*^{*z*^{*x*}}$;$*a*_{7} = (*y*^{*x*})^{*z*}$;$*a*_{8} = (*y*^{*z*})^{*x*}$;$*a*_{9} = *z*^{*x*^{*y*}}$;$*a*_{10} = *z*^{*y*^{*x*}}$;$*a*_{11} = (*z*^{*x*})^{*y*}$;$*a*_{12} = (*z*^{*y*})^{*x*}$.
Let $*m*$ be the maximum of all the $*a*_{*i*}$, and $*c*$ be the smallest index (from $1$ to $12$) such that $*a*_{*c*} = *m*$. Rat's goal is to find that $*c*$, and he asks you to help him. Rat Kwesh wants to see how much cheese he gets, so he you will have to print the expression corresponding to that $*a*_{*c*}$.
Input
The only line of the input contains three space-separated real numbers $*x*$, $*y*$ and $*z*$ ($0.1 ≤ *x*, *y*, *z* ≤ 200.0$). Each of $*x*$, $*y*$ and $*z*$ is given with exactly one digit after the decimal point.
Output
Find the maximum value of expression among $*x*^{*y*^{*z*}}$, $*x*^{*z*^{*y*}}$, $(*x*^{*y*})^{*z*}$, $(*x*^{*z*})^{*y*}$, $*y*^{*x*^{*z*}}$, $*y*^{*z*^{*x*}}$, $(*y*^{*x*})^{*z*}$, $(*y*^{*z*})^{*x*}$, $*z*^{*x*^{*y*}}$, $*z*^{*y*^{*x*}}$, $(*z*^{*x*})^{*y*}$, $(*z*^{*y*})^{*x*}$ and print the corresponding expression. If there are many maximums, print the one that comes first in the list.
$*x*^{*y*^{*z*}}$ should be outputted as x^y^z (without brackets), and $(*x*^{*y*})^{*z*}$ should be outputted as (x^y)^z (quotes for clarity).
样例
1.1 3.4 2.5
z^y^x
2.0 2.0 2.0
x^y^z
1.9 1.8 1.7
(x^y)^z
题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。