This morning, the jury decided to add one more problem (Very Simple Problem) to the Olympiad. The executive secretary of the Organizing Committee published its condition in a single copy, and now he needs to make more copies before the start of the Olympiad. He has two copy machines: the first can make a copy of one paper in seconds, and the second can make a copy in seconds. You may use either one copy machine or both simultaneously. You can make a copy not only from the original, but also from any copy.
Help him determine the minimum time required to make copies.
The first line contains three positive integers , , and (1 \leq n \leq 2 \cdot 10^8, 1 \leq x, y \leq 10).
Print one number—the minimum time in seconds required to get copies.
Beispiel 1
Beispiel 2