e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Without lift

Without lift

Three friends - Andrei, Boris and Vladimir live respectively on a, b and v floors of a multi-storey building. They play sports, so they never use the elevator. Once they needed to urgently meet at one of them at home.

Make a program that would determine the number of the floor on which they will meet, and the time before the meeting would be minimal. Note that the speed of descent down the stairs is 47/31 times higher than the speed of ascent.

Input

Three positive numbers - the floor numbers a, b, v (1a, b, v28), where friends live.

Output

Print the floor number where friends will meet.

Time limit 1 seconds
Memory limit 128 MiB
Input example #1
11 4 5
Output example #1
5
Author Oleksandr Bulanyi
Source 2013 XXVII All - Ukrainian Informatics Competition, Stage II, Dnepropetrovsk, December 28, Problem A
Mechanics