Submit solution

Points:
5 (partial)

Time limit:
0.5s

Memory limit:
162M

Problem types

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

The *beauty* of a rectangle is the ratio between the length of the longer side and the length
of the shorter side.

Given a rectangle with side lengths and , repeat the following process until you have rectangles:

```
Select one rectangle
Cut it into two rectangles
```

After doing this, all rectangles must have the same area.

The beauty of a set of rectangles is the maximum beauty present among all rectangles in the set. Compute the minimum possible beauty of the set assuming optimal cuts.

#### Constraints

#### Input Specification

The first and only line contains three space-separated integers, , , and .

#### Output Specification

Output the desired beauty to exactly six decimal places.

#### Sample Input

`5 5 5`

#### Sample Output

`1.800000`

## Comments