Split into composite numbers

What is the maximum number of composite numbers that 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 number.

Input

One integer $n(1\le n\le 10^{18})$.

Output

Print the maximum number of composite numbers that can be used such that their sum equals $n$. If the number $n$ cannot be represented as a sum of composite numbers, print $-1$.

Examples