There are so many candies in a candy shop. In this shop, candies can be sold by package or individually.
Now you want to buy $n$ candies. Please calculate how many dollars you should spend at least.
You can't buy more than $n$ candies, even thought it is cheaper.
A non-negative integer $n\ (n\leq 10000)$
An integer indicating how much the candies cost.
| No. | Testdata Range | Score |
|---|---|---|
| 1 | 0~9 | 100 |
| No. | Time Limit (ms) | Memory Limit (KiB) | Output Limit (KiB) | Subtasks |
|---|---|---|---|---|
| 0 | 1000 | 65536 | 65536 | |
| 1 | 1000 | 65536 | 65536 | |
| 2 | 1000 | 65536 | 65536 | |
| 3 | 1000 | 65536 | 65536 | |
| 4 | 1000 | 65536 | 65536 | |
| 5 | 1000 | 65536 | 65536 | |
| 6 | 1000 | 65536 | 65536 | |
| 7 | 1000 | 65536 | 65536 | |
| 8 | 1000 | 65536 | 65536 | |
| 9 | 1000 | 65536 | 65536 |