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;
long long maximum = numeric_limits<int>::max();
long long minimum = numeric_limits<int>::min();
string gg = "abcdefghijklmnopqrstuvwxyz";
int max3(int a, int b, int c) { return max(a, max(b, c)); }
int mint(int x, int y, int z) {
  if (x < y)
    return (x < z) ? x : z;
  else
    return (y < z) ? y : z;
}
vector<pair<long long int, long long int>> v;
bool sortbysec(const pair<long long int, long long int> &a,
               const pair<long long int, long long int> &b) {
  if (a.second == b.second) {
    return (a.first > b.first);
  }
  return a.second > b.second;
}
int main() {
  int n;
  cin >> n;
  while (n--) {
    long long int a;
    cin >> a;
    if (a % 4 == 0)
      cout << (a / 4) << endl;
    else if (a % 4 == 2 and a >= 6)
      cout << 1 + (a - 6) / 4 << endl;
    else if (a % 4 == 1 and a >= 9)
      cout << 1 + (a - 9) / 4 << endl;
    else if (a % 4 == 3 and a > 14)
      cout << 1 + 1 + (a - 14) / 4 << endl;
    else {
      cout << -1 << endl;
    }
  }
  return 0;
}
