You are given three integers , , and . In a single move, you can subtract any integer in the range from to from , but you are not be allowed to subtract this integer during the next moves. What is the minimum number of moves required to make strictly smaller than 0?
Input format
The first and only line of input contains three integers
Output format
Print an integer denoting the answer to the problem.
Constraints
In the first move, you can subtract 1, in the second move you can subtract 3, in the third move you can subtract 4. So, you can make equal to -1 after 3 moves.