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.*;

public class Main {
    public static boolean[] seen;
    public static long gcd(long p, long q) {
        if (q == 0) return p;
        return gcd(q, p % q);
    }
    public static int[] bfs (ArrayList[] graph, int v) {
        int[] len = new int[graph.length];
        PriorityQueue pq = new PriorityQueue();
        pq.add(v);
        for (int i = 0; i < graph.length; i++) len[i] = 10000;
        len[v] = 0;
        while (!pq.isEmpty()) {
            int r = (int) pq.remove();
            for (int i = 0; i < graph[r].size(); i++) {
                int w = (int) graph[r].get(i);
                if (len[w] > len[r]+1) {
                    len[w] = len[r] + 1;
                    pq.add(w);
                }

            }
        }
        return len;
    }
    public static void dfs(ArrayList[] graph, int v) {
        if (seen[v]) {
            return;
        }
        seen[v] = true;
        for (int i = 0; i < graph[v].size(); i++) {
            int w = (int)graph[v].get(i);
            dfs(graph,w);
        }

    }
    public static int compose(int n) {
        return 0;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int q = in.nextInt();
        int[] ans = new int[16];
        int[] simpleComposites = {4,6,9};
        ans[0] = 0;
        for (int i = 1; i < 16; i++) {
            ans[i] = -1;
            for (int j: simpleComposites) {
                if (i>=j && ans[i-j]!=-1) {
                    ans[i] = Math.max(ans[i],ans[i-j]+1);
                }
            }
        }

        for (int i = 0; i < q; i++) {
            int n = in.nextInt();
            if (n<16) out.println(ans[n]);
            else {
                int t = (n-16) / 4 + 1;
                out.println(t+ans[n-4*t]);
            }
        }





        out.flush();
    }
}