Banknotes
Adapted by Neilor Tonin, URI 
Brazil
Adapted by Neilor Tonin, URI Brazil
In this problem you have to read an integer value and calculate the smallest possible number of banknotes in which the value may be decomposed. The possible banknotes are 100, 50, 20, 10, 5, 2 and 1. Print the read value and the list of banknotes.
The input file contains an integer value N (0 < N < 1000000).
Print the read number and the minimum quantity of each necessary banknotes in Portuguese language, as the given example. Do not forget to print the end of line after each line, otherwise you will receive “Presentation Error”.
| Input Sample | Output Sample |
|
576 |
576 |
|
11257 |
11257 |
|
503 |
503 |