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.
t = int(input())
s = 0
for _ in range(t):
    a = [1,2,3,5,7,11]
    b = [4,6]
    c = [8,10]
    n = int(input())

    if n in a:
        print(-1)

    elif n in b:
        print(1)

    elif n in c:
        print(2)

    else:
        if n%4 == 0:
            s = (n-12)//4 + 3

        elif n%4 == 1:
            s = (n-13)//4 + 2

        elif n%4 == 2:
            s = (n-14)//4 + 3

        else:
            s = (n-15)//4 + 2

        print(s)