#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  x = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c <= '9' && c >= '0') {
    x = x * 10 + c - 48;
    c = getchar();
  }
}
int f[20];
int main() {
  int q, x;
  f[4] = f[6] = f[9] = 1;
  f[8] = f[10] = 2;
  f[12] = 3;
  read(q);
  for (int i = 1; i <= q; i++) {
    read(x);
    if (x <= 12) {
      if (!f[x])
        cout << -1 << "\n";
      else
        cout << f[x] << "\n";
    } else {
      switch (x % 4) {
        case 0:
          cout << x / 4 << "\n";
          break;
        case 1:
          cout << x / 4 - 1 << "\n";
          break;
        case 2:
          cout << x / 4 << "\n";
          break;
        case 3:
          cout << x / 4 - 1 << "\n";
          break;
      }
    }
  }
}

### Prompt

Develop a solution in CPP 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;
void read(int &x) {
  x = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c <= '9' && c >= '0') {
    x = x * 10 + c - 48;
    c = getchar();
  }
}
int f[20];
int main() {
  int q, x;
  f[4] = f[6] = f[9] = 1;
  f[8] = f[10] = 2;
  f[12] = 3;
  read(q);
  for (int i = 1; i <= q; i++) {
    read(x);
    if (x <= 12) {
      if (!f[x])
        cout << -1 << "\n";
      else
        cout << f[x] << "\n";
    } else {
      switch (x % 4) {
        case 0:
          cout << x / 4 << "\n";
          break;
        case 1:
          cout << x / 4 - 1 << "\n";
          break;
        case 2:
          cout << x / 4 << "\n";
          break;
        case 3:
          cout << x / 4 - 1 << "\n";
          break;
      }
    }
  }
}

```