PROGRAMMING:Fighting monsters

As the saying goes, sun dashengbao, the Tang monk, came across a monster on his way to the West. Monsters have a total of $$V $$blood drop. Every time the great sage hits a stick, the monsters will lose $$h $$blood drop. Once the monsters have no blood, they will die immediately. Dasheng beat the monster to death with a stick.
Please write a program, input $$V $$and $$h $$, output $$n $$.
####Input format
>$$V $$and $$h$$
####Output format
> $$n$$
Note: the title guarantees that the values of $$a $, $$B $$and $$n $$are in the range of int type representation.
####Input sample
```in
2510 1000
```
####Output sample
```out
three
```







answer：If there is no answer, please comment