Dee Dee went to market to buy some eggs. There are 2 type of egg cartons available in the shop. One type contains 6 eggs and the other type contains 8 eggs. Dee Dee wants to buy exactly N eggs. Calculate the minimal number of egg cartons she must buy.

INPUT

First line of input gives T, the number of test cases.
T lines follow, each having N, the number of eggs.

OUTPUT

Print the minimal number of egg cartons she must buy.
If it's impossible to buy exactly n eggs, print -1.

CONSTRAINTS
1 ≤ T ≤ 50
1 ≤ N ≤ 100

SAMPLE INPUT
2
20
24

SAMPLE OUTPUT
3
3

Explanation

For first case, she should buy 2 cartons containing 6 eggs and 1 carton containing 8 eggs. In total, she buys 3 egg cartons.
For second case, there are two ways to buy 24 eggs: buy 4 cartons containing 6 eggs or buy 3 cartons containing 8 eggs. Minimize the number of cartons.
l=[i for i in range(6,101,2)]
g=[1,1,-1,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,7,7,7,7,8,8,8,8,9,9,9,9,10,10,10,10,11,11,11,11,12,12,12,12,13,13]
t=int(raw_input())
while(t):
	n=int(raw_input())
	if(n not in l):
		print '-1'
	else:
		z=l.index(n)
		print g[z]
	t-=1