A ticket for one trip in the metro costs 15 rubles, a ticket for 5 trips costs 70 rubles, a ticket for 10 trips costs 125 rubles, a ticket for 20 trips costs 230 rubles, a ticket for 60 trips costs 440 rubles. The passenger plans to make n trips. Determine how many tickets of each type he must purchase so that the total number of paid trips is not less than n, and the total cost of purchased tickets – minimal.
Input
Given one number n - the number of trips.
Imprint
Print five integers equal to the required number of tickets for 1, 5, 10, 20, 60 trips. If for some given n there are several ways to purchase tickets of the same cost, you need to print the combination of tickets that gives the most number of trips.
Examples
| # |
Input |
Output |
| 1 |
1 |
1 0 0 0 0 |