The problem is to cut the largest possible number of circles with diameter out of a stripe of length and width .
The only line of input contains two positive real numbers and with up to digits after the decimal point, separated by a space. Integers may be written without a decimal point.
Output a single integer — the maximum number of circles that can be cut out of the stripe.
Example 1