Problem:
Change-Making Problem

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

$n$

The integer $n$ is given in a line.

出力

Print the minimum number of coins you need in a line.

Constraints

$1 \le n \le 10^9$

Sample Input 1

100

Sample Output 1

4

Sample Input 2

54321

Sample Output 2

2175

Solution in PHP (judge verdict: Accepted)

<?php
$money=(int)trim(fgets(STDIN));
$coin = [25,10,5,1];
echo GetRequiredNumber($money,$coin).PHP_EOL;

function GetRequiredNumber($money,$coin){
    $count = 0;
    for($i=0; $i<4; ++$i){
        $quotient = floor($money/$coin[$i]);
        $count += $quotient;
        if($money%$coin[$i]==0){
            return $count;
        }
        $money -= $quotient*$coin[$i];
    }
}
?>