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.
# from math import sqrt; from itertools import count, islice

# def isPrime(n):
#     return n > 1 and all(n%i for i in islice(count(2), int(sqrt(n)-1)))

n = int(input())
answer = []

# def prox_n_primo(numero):
# 	while True:
# 		numero +=1
# 		if not isPrime(numero):
# 			return numero


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

	if i < 4:
		answer.append(str(-1))
		continue


	v = 4
	counter = i//4
	i = i%4

	# while i >= 4:
	# 	divide = i//v
	# 	i = i%(v*divide)
	# 	counter += divide

	if i == 0 or i == 2:
		answer.append(str(counter))
	elif i == 1:
		if counter > 1:
			answer.append(str(counter-1))
		else:
			answer.append(str(-1))
	elif i == 3:
		if counter >= 3:
			answer.append(str(counter-1))
		else:
			answer.append(str(-1))



print('\n'.join(answer))