John, Bruce and juice#3757

John, Bruce and juice

0.3 seconds
256 megabytes
Easy

John has some money. Bruce has some money too. They know the price of a bottle of juice (unfortunately, juice is not free). How many bottles of juice can they buy if they put their money together?

Input

The first line of input contains John's amount of money. The second line contains Bruce's amount of money. The third line contains the price of a bottle of juice. Each amount or price is represented by a non-empty integer part, a decimal point, and exactly two digits after the point. Each (John's and Bruce's) amount of money is non-negative and strictly less than . Juice is not free and costs strictly less than .

Output

Your program should output exactly one integer: the maximum number of bottles the guys can buy by pooling their money together.

Examples

Example 1

Loading
Loading