What is the largest number of composite integers can be used to represent the number n as a sum of composite numbers?
Note: A positive integer that has a divisor other than itself and 1 is called a composite.
One integer n (1 ≤ n ≤ 10^18
).
Print the largest number of composite integers that can be used so that their sum equals n. If n cannot be represented as a sum of composite numbers, print -1.