Given two long integers, min and max, find and print a common fraction, $\frac{d}{d},$

such that min $d$max and $|\frac{n}{d}-|$ is minimal $($recall that

$$~~$3\mathrm{.}1415926535897932384626433832795028841971693993751).$ If

there are several fractions having minimal distance to $,$ choose the one with the

smallest denominator.

Input Format

Two space$-$separated long integers describing the respective values of min and

max.

Constraints

$-1$min$$max${10}^{15}$

Output Format

Print your answer in the form $\frac{n}{d},$ where $n$ is the numerator of the fraction