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>
using namespace std;
int main() {
  int t, i;
  cin >> t;
  while (t--) {
    int n, rem;
    cin >> n;
    if (n % 4 == 0 || n % 6 == 0) {
      cout << n / 4 << "\n";
    } else if (n % 5 == 0 && n != 5) {
      if (n % 2 == 0) {
        cout << n / 4 << "\n";
      } else {
        rem = n - 9;
        cout << 1 + (rem / 4) << "\n";
      }
    } else if (n % 2 == 0 && n != 2) {
      cout << n / 4 << "\n";
    } else if (n != 7 && n != 5 && n != 11 && n != 14 && n != 3 && n != 1 &&
               n != 2) {
      rem = n - 9;
      cout << 1 + (rem / 4) << "\n";
    } else if (n == 14) {
      cout << "3"
           << "\n";
    } else {
      cout << "-1"
           << "\n";
    }
  }
}
