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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.StringTokenizer;


public class A {

    public static void main(String[] args) throws IOException{
//        Scanner in = new Scanner(System.in);
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	int t = Integer.parseInt(in.readLine());
        
        PrintWriter out = new PrintWriter(System.out);
        
        int d[] = new int[16];
        Arrays.fill(d, -1);
        d[0] = 0;
        for (int i = 4;i < 16; i++) {
            if (d[i - 4] != -1) d[i] = Math.max(d[i], d[i - 4] + 1);
            if (i >= 6 && d[i - 6] != -1) d[i] = Math.max(d[i], d[i - 6] + 1);
            if (i >= 9 && d[i - 9] != -1) d[i] = Math.max(d[i], d[i - 9] + 1);            
        }
        
        for(int i=0;i<t;i++){
            StringTokenizer st = new StringTokenizer(in.readLine());
            int n = Integer.parseInt(st.nextToken());
            int ans = 0;
            if (n > 15) {
                ans = ((n - 16) / 4) + 1;
                n = n - (ans * 4);
            }
            out.println(ans + d[n]);
	}
                out.close();
    }
}