#972. Fewest coins 1, 3, 4
You have as many 1, 3, 4 coins as you want. Find the smallest number of coins that add up to n. If it is impossible, print -1.
### Input
One integer n (0 ≤ n ≤ 1000).
### Output
A number.
Examples
Input
949
Output
238
Input
464
Output
116
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.