#992. Fewest coins 3, 5, 7
You have as many 3, 5, 7 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
107
Output
17
Input
313
Output
45
💡 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.