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.
def prime(x):
    if x==2 or x==3:
        return(True)
    if x%2==0:
        return(False)
    i=1
    while(i<x**0.5):
        i=i+2
        if x%i==0:
            return(False)

    return(True)
def comp(x):
    i=1
    l=[]
    while(x>1):
        i=i+1
        if prime(i) and x%i==0:
            while(x%i==0):
                x=x/i
                l.append(i)
    return l 
def sol(x):
    k=0
    i=x//2+1
    l=[]
    while(i>1):
        i=i-1
        if x%i==0 :
            l.append(i)
            k=k+1
    if k==2:
        if prime(l[0]) and prime(l[1]):
            return 1
        else:
            return(max(l))
    if k>2:
        l=comp(x)
        l.sort()
        s=1
        for j in range(2,len(l)):
            s=s*l[j]
        return(s)
def sol2(x):
    s=0
    while(x>1):
        if x%2==1 and x>9:
            s=s+1
            x=x-9
        elif x%4!=0 :
            x=x-6
            s=s+1
        elif x%4==0:
            if x==4:
                s=s+1
                x=x-4
            else:
                s=(s+x//4)
                x=1
    return(s)
        
n=int(input())
l=[]
for i in range(n):
    a=int(input())
    if a<12 and prime(a):
        print(-1)
    elif a in [4,6,9]:
        print(1)
    else:
        print(sol2(a))
    
