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

import static java.lang.Math.*;

public class Solver {
    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);
        int f = nextInt();
        for (int i = 0; i < f; i++) {
            int n = nextInt();
            if (n % 4 == 0) {
                pw.println(n / 4);
            } else if (n % 4 == 1) {
                if (n < 9) pw.println(-1);
                else {
                    int cnt = 1;
                    cnt += (n - 9) / 4;
                    pw.println(cnt);
                }
            } else if (n % 4 == 2) {
                if (n == 2) pw.println(-1);
                else {
                    int cnt = 1;
                    cnt += (n - 6) / 4;
                    pw.println(cnt);
                }
            } else {
                if (n < 15) pw.println(-1);
                else {
                    int cnt = 2;
                    cnt += (n - 15) / 4;
                    pw.println(cnt);
                }
            }
        }
        pw.close();
    }

    static StringTokenizer st = new StringTokenizer("");
    static BufferedReader br;

    static String next() throws IOException {
        while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}