8630: ALDS1_15_A : Change-Making Problem
[Creator : ]
Description
You want to make change for $n$ cents.
Assuming that you have infinite supply of coins of 1, 5, 10 and/or 25 cents coins respectively, find the minimum number of coins you need.
Input
The integer $n$ is given in a line.
Output
Print the minimum number of coins you need in a line.
Constraints
$1 \leq n \leq 10^9$
Sample 1 Input
100
Sample 1 Output
4
Sample 2 Input
54321
Sample 2 Output
2175