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;
template <typename... T>
void read(T &...args) {
  ((cin >> args), ...);
}
template <typename... T>
void write(T... args) {
  ((cout << args), ...);
}
using vcl = vector<long>;
using vcc = vector<char>;
using vcs = vector<string>;
using vcd = vector<double>;
using vcll = vector<long long>;
using vcb = vector<bool>;
using vc = vector<int>;
using si = set<int>;
using sll = set<long long>;
using sl = set<long>;
using sc = set<char>;
using ss = set<string>;
void printV(vcll &v) {
  for (auto i : v) write(i, " ");
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long q;
  read(q);
  while (q--) {
    vcb a(13);
    a[1] = true;
    a[2] = true;
    a[3] = true;
    a[5] = true;
    a[7] = true;
    a[11] = true;
    long long n;
    read(n);
    if (n <= 11 && a[n])
      write(-1, "\n");
    else {
      long long numberOfFour = n / 4;
      long long reminder = n % 4;
      if (reminder == 0)
        write(numberOfFour, "\n");
      else if (reminder == 1)
        write(numberOfFour - 1, "\n");
      else if (reminder == 2)
        write(numberOfFour, "\n");
      else if (reminder == 3)
        write(numberOfFour - 1, "\n");
    }
  }
}
