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.
q = int(input())

U = 200
primes = [2, 3]
for i in range(5, U + 1, 2):
    if all(i % x != 0 for x in primes):
        primes.append(i)

dp = [-1, -1, -1, -1, 1]
for i in range(5, U + 1):
    val = max(dp[i - 4], dp[i - 6 if i >= 6 else 0],
              dp[i - 9 if i >= 9 else 0])
    dp.append(max(1 if i not in primes else -1, val + 1 if val > 0 else -1))

for i in range(q):
    n = int(input())

    if n > U:
        c = 1
        while True:
            ans = ((n - U) // 4) + c
            N = n - 4 * ans
            c += 1
            if dp[N] > 0:
                break
            if c >= U - 1:
                break
    else:
        ans = 0
    print(ans + dp[n - 4 * ans] if dp[n - 4 * ans] != 0 else -1)
