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.util.Scanner;

public class a {
	public static void main(String[] args) {
		memo = new Integer[1001];
		Scanner in = new Scanner(System.in);
		int q = in.nextInt();
		while(q --> 0) {
			int n = in.nextInt();
			int diff = n - 900;
			int res = 0;
			if(diff >= 0) {
				res = diff / 4;
				n = 900 + (diff % 4);
			}
			int go = go(n);
			if(go < 0)
				System.out.println(-1);
			else
				System.out.println(go + res);
		}
		
	}
	static int[] opts = {4,6,9};
	static Integer[] memo;
	static int go(int x) {
		if(x == 0)
			return 0;
		if(x < 0)
			return -10000000;
		if(memo[x] != null)
			return memo[x];
		int ans = -10000000;
		for(int opt : opts) {
			ans = Math.max(ans, go(x-opt)+1);
		}
		return memo[x] = ans;
	}
}
