Olympics

With each successful or failed lift draining energy, guarantee a successful lift within d of an unknown strength from 25 to 225 kg and minimize d.

Hard8Dynamic programmingMathNo attempts yetTime limit2sMemory limit256 MB

Problem

The weightlifting event is next, and it is time to impress the crowd. Your strength SS stays the same all evening, but your energy EE drops with every attempt. On each attempt you pick any positive weight WW, which need not be an integer. If SWS \ge W the lift succeeds and your energy drops by EsuccE_{succ}. If S<WS < W the lift fails and your energy drops by EfailE_{fail}. You may keep attempting lifts while your energy stays above 00, and once it reaches 00 or less you cannot attempt anything more. Your score is the heaviest weight you lifted successfully, or 00 if every attempt failed.

The best score comes from lifting exactly at your strength limit, but you do not know that limit. You know only two things. The 25 kg bar always goes up. And 225 kg, the bar plus 100 kg on each side, is the heaviest lift anyone can imagine. So 25S22525 \le S \le 225, and SS can be any value in that range.

How close to the optimal score can you guarantee? That is, find the smallest dd such that you can guarantee a score of at least SdS - d whatever SS turns out to be.

Input

The first line contains three space-separated integers EE, EsuccE_{succ} and EfailE_{fail} (1E,Esucc,Efail1071 \le E, E_{succ}, E_{fail} \le 10^7).

Output

Print the minimum dd on one line, rounded at the seventh decimal place and padded to exactly six decimal places.