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 {
    static BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));
    static StringBuilder ans = new StringBuilder();
    static String line;

    static void solve() throws IOException {
//        input = new BufferedReader(new FileReader("/home/noberel/Downloads/Software Construction/problems/src/main/java/input"));
//        output = new BufferedWriter((new FileWriter("/home/noberel/Downloads/Software Construction/problems/src/main/java/output")));
        int q = Integer.parseInt(input.readLine());
        for (int i = 0; i< q; i++) {
            int n = Integer.parseInt(input.readLine());
            int res;
            switch (n) {
                case 1: res = -1; break;
                case 2: res = -1; break;
                case 3: res = -1; break;
                case 4: res = 1; break;
                case 5: res = -1; break;
                case 6: res = 1; break;
                case 7: res = -1; break;
                case 11: res = -1; break;
                default:
                    int k = n % 4;
                    switch (k) {
                        case 1: n -= 9; res = 1; break;
                        case 2: n -= 6; res = 1; break;
                        case 3: n -= 15; res = 2; break;
                        default: res = 0; break;
                    }
                    res += n / 4;
            }
            ans.append(res).append('\n');
        }
        output.write(ans.toString());
        output.flush();
        output.close();
    }

    public static void main(String[] args) throws IOException {
        new Main().solve();
    }
}
