D - Maximum splitting

点击打开链接

You are given several queries. In the i-th query you are given a single positive integer n_i. You are to represent n_i 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 ≤ 10⁵) — the number of queries.

q lines follow. The (i + 1)-th line contains single integer n_i (1 ≤ n_i ≤ 10⁹) — thei-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.

Example

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.

代码

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	int n,m;
    while(scanf("%d",&n)!=EOF)
    {
    	while(n--)
    	{
    		scanf("%d",&m);
    		if(m<=3||m==5||m==7||m==11)
    		printf("-1\n");
    		else
    		{
    			int ans=m/4;
    			if((m%4)%2)
				ans--;
				printf("%d\n",ans); 
			}
		}
	}
return 0;
}