5656: Very Easy Task
[Creator : ]
Description
This morning the jury decided to add one more, Very Easy Problem to the problemset of the olympiad. The executive secretary of the Organizing Committee has printed its statement in one copy, and now they need to make nn more copies before the start of the olympiad.
They have two copiers at his disposal, one of which copies a sheet in $x$ seconds, and the other in $y$ seconds. (It is allowed to use one copier or both at the same time. You can copy not only from the original, but also from the copy.)
Help them find out what is the minimum time they need to make $n$ copies of the statement.
They have two copiers at his disposal, one of which copies a sheet in $x$ seconds, and the other in $y$ seconds. (It is allowed to use one copier or both at the same time. You can copy not only from the original, but also from the copy.)
Help them find out what is the minimum time they need to make $n$ copies of the statement.
Input
The program receives three integers $n,\ x,\ y\ (1≤n≤2⋅10^8,\ 1≤x,y≤10)$.
Output
Print one integer, the minimum time in seconds required to get $n$ copies.
Sample 1 Input
4 1 1
Sample 1 Output
3
Sample 2 Input
5 1 2
Sample 2 Output
4