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;
const long long maxll = 1e10;
const long long maxn = 1e5 + 1;
const long double eps = 0.0000001;
vector<long long> prefix_function(string s) {
  long long n = (long long)s.length();
  vector<long long> pi(n);
  for (long long i = 1; i < n; ++i) {
    long long j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) ++j;
    pi[i] = j;
  }
  return pi;
}
long long n, m, t, xx, yy = maxll, zz = maxll, k, kek = maxll, ans = -maxll,
                       ansn;
long long x, y, z;
char ch;
string s;
long long a[100001], b[10], c;
map<int, int> mp;
int main() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> x;
    if (x == 1 || x == 2 || x == 3 || x == 5 || x == 7 || x == 11)
      cout << -1;
    else if (x % 4 == 0)
      cout << x / 4;
    else if (x % 2 == 0)
      cout << (x - 2) / 4;
    else
      cout << (x - 9) / 4 + 1;
    cout << endl;
  }
  return 0;
}
