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.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * Created by Tejas on 13-06-2018.
 */
public class Main {


    public static void main(String[] args) throws IOException {

        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        int T =Integer.parseInt(bufferedReader.readLine());
        StringBuilder stringBuilder=new StringBuilder();
        while(T-- >0){
            int N=Integer.parseInt(bufferedReader.readLine());
            stringBuilder.append(solve(N)+"\n");
        }
        System.out.println(stringBuilder);
}

    private static int solve(int N) {

        if(N%4==0)
            return N/4;

        if(N>15){
            if(N%4==1)
                return 1+(N-9)/4;
            if(N%4==2)
                return 1+(N-6)/4;
            if(N%4==3)
                return 2+(N-15)/4;
        }

        if(N==1|| N==2 || N==3 ||N==5 || N==7 ||N==11 )
            return -1;
        if(N==6 || N==9)
            return 1;
        if(N==10 ||N==15 ||N==13)
            return 2;
        if(N==12 ||N==14)
            return 3;


        return 0;
    }
}
