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.
#include <bits/stdc++.h>
int main() {
  int q;
  long n[100005];
  long fours;
  int i;
  long rem;
  long out;
  scanf("%d", &q);
  for (i = 0; i < q; i++) scanf("%d", &n[i]);
  for (i = 0; i < q; i++) {
    if (n[i] >= 12) {
      fours = n[i] / 4;
      rem = n[i] - 4 * fours;
      if (rem == 0) out = fours;
      if (rem == 1) out = fours - 1;
      if (rem == 2) out = fours;
      if (rem == 3) out = fours - 1;
    }
    if ((n[i] == 1) | (n[i] == 2) | (n[i] == 3) | (n[i] == 7) | (n[i] == 5) |
        (n[i] == 11))
      out = -1;
    if ((n[i] == 4) | (n[i] == 6) | (n[i] == 9)) out = 1;
    if ((n[i] == 8) | (n[i] == 10)) out = 2;
    printf("%ld \n", out);
  }
  return 0;
}
