#include <iostream>
using namespace std;

int main() {
    int x;
    cin >> x;
    cout << 1000 * (x / 500) + 5 * ((x % 500) / 5);
}

### Prompt

Your challenge is to write a cpp solution to the following problem:

Takahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)

Takahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?

(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)

Constraints

* 0 \leq X \leq 10^9
* X is an integer.

Input

Input is given from Standard Input in the following format:


X


Output

Print the maximum number of happiness points that can be earned.

Examples

Input

1024


Output

2020


Input

0


Output

0


Input

1000000000


Output

2000000000

### Response

```cpp
#include <iostream>
using namespace std;

int main() {
    int x;
    cin >> x;
    cout << 1000 * (x / 500) + 5 * ((x % 500) / 5);
}

```