Codeforces Round #440 C. Maximum splitting

C. Maximum splitting

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

　四种情况：

　　　　（1）n%4 == 0：

　　　　　　全分成4就好了，所以ans = n/4

　　　　（2）n%4 == 1：

　　　　　　剩下的1要和两个4组合成一个9。

　　　　　　所以如果n/4 >= 2，ans = n/4 - 1

　　　　　　否则ans = -1

　　　　（3）n%4 == 2：

　　　　　　剩下的2要和一个4组合成一个6。

　　　　　　所以如果n/4 >= 1，ans = n/4

　　　　　　否则ans = -1

　　　　（4）n%4 == 3：

　　　　　　剩下的3 = 1 + 2。所以需要三个4，组成一个6和一个9。

　　　　　　所以如果n/4 >= 3，ans = n/4 - 1

#include <iostream>
#include <cstdio>
using namespace std;
int main() {
    int n,t;
    scanf("%d",&t);
    while (t--) {
        scanf("%d",&n);
        if(n%4==0)
            printf("%d\n",n/4);
        else if(n%4==1)
        {
            if(n/4>=2)
                printf("%d\n",n/4-1);
            else
                printf("-1\n");
        }
        else if(n%4==2)
        {
            if(n/4>=1)
                printf("%d\n",n/4);
            else
                printf("-1\n");
        }
        else
        {
            if(n/4>=3)
                printf("%d\n",n/4-1);
            else
                printf("-1\n");
        }
    }
    // insert code here...
    //std::cout << "Hello, World!\n";
    return 0;
}