codeforces 870C. Maximum splitting(数学)

memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given several queries. In the i-th query you are given a single positive integer ni. You are to represent ni as a sum of maximum possible number of composite summands and print this maximum number, or print -1, if there are no such splittings.

An integer greater than 1 is composite, if it is not prime, i.e. if it has positive divisors not equal to 1 and the integer itself.

Input
The first line contains single integer q (1 ≤ q ≤ 105) — the number of queries.

q lines follow. The (i + 1)-th line contains single integer ni (1 ≤ ni ≤ 109) — the i-th query.

Output
For each query print the maximum possible number of summands in a valid splitting to composite summands, or -1, if there are no such splittings.

Examples
input
1
12
output
3
input
2
6
8
output
1
2
input
3
1
2
3
output
-1
-1
-1
Note
12 = 4 + 4 + 4 = 4 + 8 = 6 + 6 = 12, but the first splitting has the maximum possible number of summands.

8 = 4 + 4, 6 can’t be split into several composite summands.

1, 2, 3 are less than any composite number, so they do not have valid splittings.
比赛时能写出来这道题纯属瞎蒙,把结果为-1列出来,再把1列出来,从10之后一个个往后手动找答案发现了周期.后来问大佬才知道正确的思路:
最小的合数为偶数是4,最小的是奇数的合数为9.所以每一个偶数都可以分成若干个4,每一个奇数减去9之后都可以转换成偶数,再按偶数去求即可.