Petriukas has an infinite number of wooden rods, each of length
š¯‘›.
He wants to make two identical door frames, where the two vertical beams (left and right) are of length
š¯‘ˇ
each, and one horizontal beam (top beam) is of length
š¯‘¸.
Each beam requires a continuous piece of wood.
Determine the minimum number of wooden rods required to make the two door frames.
Petriukas can cut the rods into any pieces, but each door beam must be a single continuous piece of a rod.
Input
The input consists of three integers,
š¯‘›,
š¯‘ˇ, and
š¯‘¸, each given on a separate line. (1 \le n \le 1000, 1 \le a,b\le n).
Output
Output the minimum number of rods required.
Examples
| standard input | standard output |
|---|
| 8
1
2
| 1
|
| 5
3
4
| 6
|
| 6
4
2
| 4
|