You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Time Limit: 1.0 s

Memory Limit: 256.0 MB

Description

Mr. Heart is planning a festival and wants to maximize his festivity points by purchasing decorations.
He can buy two types of decorations:

• Illuminating Lanterns: Each costs 500 joy tokens and gives 1000 festivity points.
• Vibrant Banners: Each costs 5 joy tokens and gives 5 festivity points.

Mr. Heart has \(N\) joy tokens to spend, and he wants to maximize the festivity points he can obtain.

Input

The only line contains an integers Value \(N\), The total number of joy tokens available.

(\(1 \le N \le 10^9\))

Output

The maximum number of festivity points Mr. Heart can achieve.

Sample

1032

2030

55

55

1000000000

2000000000