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.
for _  in range(int(input())):
    k=int(input())
    if k == 4 or k == 6 or k == 9:
        print(1)
    elif k == 1 or k == 2 or k == 3 or k == 5 or k == 7 or k == 11:
        print(-1)
    else:
        comp = [4, 6, 9]
        if k % comp[0] == 0:
            print(k // comp[0])
        elif (k - comp[1]) % comp[0] == 0:
            print((k - comp[1]) // comp[0] + 1)
        elif (k - comp[2]) % comp[0] == 0:
            print((k - comp[2]) // comp[0] + 1)
        elif (k - comp[2] - comp[1]) % comp[0] == 0:
            print((k - comp[2] - comp[1]) // comp[0] + 2)
        elif k % comp[1] == 0:
            print(k // comp[1])
        elif (k - comp[2]) % comp[1] == 0:
            print((k - comp[2]) // comp[1] + 1)
        else:
            print(k // comp[2])




