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 Ruby (judge verdict: Accepted)

=begin
1
 セント, 
5
 セント, 
10
 セント, 
25
 セント硬貨を使って 
n
 セント分のお釣りを作ります。
=end

a = gets.to_i

k = 0

[25, 10, 5, 1].each do |x|
    k += a / x
    a %= x
end

print k, "\n"