+ محدودیت زمان: ۱ ثانیه + محدودیت حافظه: ۲۵۶ مگابایت ---------- Sina decided to challenge Nima! He gave him a real number $A$ and a bag full of cards with exactly one number $1-5$ written on each card. There is an unlimited quantity of each type of card. Nima's task is to pick **the minimum number of cards** in a way that the average of the numbers written on them equals exactly $A$. # ورودی First and only line of input contains real number $A$. $A$ will have between $1$ and $9$ decimal places, inclusive . $$1 \le A \le 5$$ # خروجی First and only line of output should contain 5 nonnegative integers - numbers of the ones, twos, threes, fours and fives used, respectively. **If there are multiple solutions, output any one of them.** # مثال ## ورودی نمونه ۱ ``` 5.0 ``` ## خروجی نمونه ۱ ``` 0 0 0 0 1 ``` ## ورودی نمونه ۲ ``` 4.5 ``` ## خروجی نمونه ۲ ``` 0 0 0 1 1 ``` ## ورودی نمونه ۳ ``` 3.20 ``` ## خروجی نمونه ۳ ``` 0 0 4 1 0 ```