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>
const long long int mrx = 1e6 + 5, M = 1e9 + 7, dm = 1e3 + 5;
const long double pi = 3.1415926535897932384626433832795028841971693993751;
long long int mx = -1e18, mn = 1e18;
using namespace std;
long long int q, n[mrx];
int main() {
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cin >> q;
  for (int i = 0; i < q; i++) {
    cin >> n[i];
  }
  for (int i = 0; i < q; i++) {
    if (n[i] == 1 || n[i] == 2 || n[i] == 3 || n[i] == 5 || n[i] == 7 ||
        n[i] == 11) {
      cout << "-1\n";
    } else if (n[i] == 6) {
      cout << "1\n";
    } else if (n[i] % 4 == 0) {
      cout << n[i] / 4 << "\n";
    } else if (n[i] % 2 == 0) {
      cout << (n[i] - 6) / 4 + 1 << "\n";
    } else if (n[i] % 2 != 0) {
      if ((n[i] - 9) % 4 == 0) {
        cout << (n[i] - 9) / 4 + 1 << "\n";
      } else {
        cout << (n[i] - 15) / 4 + 2 << "\n";
      }
    }
  }
  return 0;
}
