Maximum splitting

Description:

Input:

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

q lines follow. The (i + 1)-th line contains single integer n_i (1 ≤ n_i ≤ 10⁹) — 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.

Sample Input:

1
12

Sample Output:

3

Sample Input:

2
6
8

Sample Output:

1
2

Sample Input:

3
1
2
3

Sample 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.