A tube ticket for 1 trip costs 15 roubles, 5 trips – 70 roubles, 10 trips – 125 roubles, 20 trips – 230 roubles, and 60 trips – 440 roubles. A passenger plans to take n trips. Determine the optimal combination of tickets to cover at least n trips for the lowest total price.

A single number n is given – the number of trips.

Output five integers representing the required number of tickets for 1, 5, 10, 20, and 60 trips. If there are multiple options with the same total cost, output the one with the highest number of total trips.

[{'input': '1', 'output': '1 0 0 0 0'}]