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>
void up();
int main() {
  std::ios::sync_with_stdio(0);
  std::cin.tie(0);
  int numTest;
  std::cin >> numTest;
  while (numTest--) up();
}
auto const data = [] {
  std::array<int, 100> data;
  data.fill(INT_MIN);
  data[0] = 0;
  for (int i = 4; i < (int)data.size(); ++i)
    for (int j = 2; j * j <= i; ++j)
      if (i % j == 0) {
        for (int k = i; k < (int)data.size(); ++k)
          if (data[k - i] != INT_MIN)
            data[k] = std::max(data[k], data[k - i] + 1);
        break;
      }
  return data;
}();
void up() {
  int number;
  std::cin >> number;
  int result =
      number < (int)data.size() ? 0 : ((number - (int)data.size()) / 4 + 1);
  number -= result * 4;
  result = data[number] == INT_MIN ? -1 : result + data[number];
  std::cout << result << '\n';
}
