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.*; // тут лежат все коллекции, Random

// имя начинается с двух подчеркиваний, чтобы был первым в списке (он сортится по алфавиту)
public class __Solution {

    // определяет, запускается решение "дома" или на CF/timus
    static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    public static void main(String[] args) {
        new __Solution().run();
    }

    BufferedReader in;
    PrintWriter out;
    StringTokenizer tok;

    void init() throws FileNotFoundException {
        // иницилизация потоков вводилок/выводилок
        // System.in/System.out - стандартные потоки ввода/вывода на консоль

        if (ONLINE_JUDGE) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt");
        }

        tok = new StringTokenizer("");
    }

    void run() {
        try {
            long timeStart = System.currentTimeMillis();

            init();
            solve();

            out.close();

            long timeEnd = System.currentTimeMillis();
            System.err.println("Time = " + (timeEnd - timeStart));
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    // чтение строки вернет null, если ничего не осталось
    String readLine() throws IOException {
        return in.readLine();
    }

    // содержит символы, являющиеся "разделителями ввода"
    // по умолчанию это пробел (перевод строки автоматом учитывается)
    String delimiter = " ";

    String readString() throws IOException {
        while (!tok.hasMoreTokens()) {
            String nextLine = readLine();
            if (null == nextLine) return null;

            tok = new StringTokenizer(nextLine);
        }

        return tok.nextToken(delimiter);
    }

    int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    long readLong() throws IOException {
        return Long.parseLong(readString());
    }

    // тут мы будем писать основное решение
    void solve() throws IOException{
        int q = readInt();
        for (int i = 0; i < q; i++){
            int N = readInt();
            int answer = -1;
            switch(N%4){
                case 0: if (N >= 4) answer = N/4;
                        break;
                case 1: if (N >= 9) answer = (N-9)/4 + 1;
                        break;
                case 2: if (N >= 6) answer = (N-6)/4 + 1;
                        break;
                case 3: if (N >= 15) answer = (N-15)/4 + 2;
            }
            out.println(answer);
        }
    }
}