#include <bits/stdc++.h>
using namespace std;
int IN() {
  int c, f, x;
  while (!isdigit(c = getchar()) && c != '-')
    ;
  c == '-' ? (f = 1, x = 0) : (f = 0, x = c - '0');
  while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
  return !f ? x : -x;
}
int main() {
  for (int q = IN(); q--;) {
    int n = IN();
    if (n % 4 == 0) {
      printf("%d\n", n / 4);
    } else if (n % 4 == 1) {
      if (n <= 5)
        puts("-1");
      else
        printf("%d\n", (n - 5) / 4);
    } else if (n % 4 == 2) {
      if (n <= 2)
        puts("-1");
      else
        printf("%d\n", (n - 2) / 4);
    } else if (n % 4 == 3) {
      if (n <= 11)
        puts("-1");
      else
        printf("%d\n", (n - 7) / 4);
    }
  }
}

### Prompt

Please provide a cpp coded solution to the problem described below:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int IN() {
  int c, f, x;
  while (!isdigit(c = getchar()) && c != '-')
    ;
  c == '-' ? (f = 1, x = 0) : (f = 0, x = c - '0');
  while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
  return !f ? x : -x;
}
int main() {
  for (int q = IN(); q--;) {
    int n = IN();
    if (n % 4 == 0) {
      printf("%d\n", n / 4);
    } else if (n % 4 == 1) {
      if (n <= 5)
        puts("-1");
      else
        printf("%d\n", (n - 5) / 4);
    } else if (n % 4 == 2) {
      if (n <= 2)
        puts("-1");
      else
        printf("%d\n", (n - 2) / 4);
    } else if (n % 4 == 3) {
      if (n <= 11)
        puts("-1");
      else
        printf("%d\n", (n - 7) / 4);
    }
  }
}

```