Without lift#7107
Three friends — Andrei, Boris, and Vladimir — live respectively on floors , , and of a multi-storey building. They are athletic and therefore never use the elevator. One day, they need to urgently meet at one of their homes.
Write a program to determine the floor number where they should meet so that the total time before all friends have arrived is minimized. Note that their speed when descending stairs is \dfrac{47}{31} times faster than their speed when ascending.
The input contains three positive integers — the floor numbers where the friends live: , , and (1 \leq a, b, v \leq 28).
Print one integer — the floor number where the friends will meet.
Пример 1