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.*;
import java.util.*;
//https://codeforces.com/problemset/problem/870/C
public class eight_seventy_C {
    public static void main(String[] args) throws Exception {
        FastScanner input = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        int q = input.nextInt();
        for (int i = 0; i < q; i++){
            int c = input.nextInt();
            int ret = 0;
            if (c % 2 == 1){
                c -= 9;
                ret++;
            }
            if (c % 4 == 2){
                c -= 6;
                ret ++;
            }
            if (c < 0){
                System.out.println(-1);
                continue;
            }
            ret += (c / 4);
            System.out.println(ret);
        }
//        int N = 0;
//        int[] queries = new int[q];
//        for (int i = 0; i < q; i++){
//            queries[i] = input.nextInt();
//
//            N = Math.max(queries[i], N);
//        }
//        int[] dp = new int[Math.max(10, N + 1)];
//        Arrays.fill(dp, -1);
//        dp[4] = 1;
//        dp[6] = 1;
//        dp[8] = 2;
//        dp[9] = 1;
        //if odd take away 9
        //if mod 4 = 2 take away 6
        //rest is 4
//        for (int i = 10; i <= N; i++){
//            if (dp[i - 4] != -1){
//                dp[i] = Math.max(dp[i], dp[i - 4] + 1);
//            }
//            if (dp[i - 6] != -1){
//                dp[i] = Math.max(dp[i], dp[i - 6] + 1);
//            }
//            if (dp[i - 9] != -1){
//                dp[i] = Math.max(dp[i], dp[i - 9] + 1);
//            }
//        }
////        System.out.println(Arrays.toString(dp));
//        for (int i : queries){
//            System.out.println(dp[i]);
//        }

    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream stream) {
            br = new BufferedReader(new InputStreamReader(stream));
            st = new StringTokenizer("");
        }

        public FastScanner(String fileName) throws Exception {
            br = new BufferedReader(new FileReader(new File(fileName)));
            st = new StringTokenizer("");
        }

        public String next() throws Exception {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
            return st.nextToken();
        }

        public int nextInt() throws Exception {
            return Integer.parseInt(next());
        }

        public long nextLong() throws Exception {
            return Long.parseLong(next());
        }

        public Double nextDouble() throws Exception {
            return Double.parseDouble(next());
        }

        public String nextLine() throws Exception {
            if (st.hasMoreTokens()) {
                StringBuilder str = new StringBuilder();
                boolean first = true;
                while (st.hasMoreTokens()) {
                    if (first) {
                        first = false;
                    } else {
                        str.append(" ");
                    }
                    str.append(st.nextToken());
                }
                return str.toString();
            } else {
                return br.readLine();
            }
        }
    }
}
