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 double PI =
    3.14159265358979323846264338327950288419716939937510582097494459230781640628620899863;
const long long INF = 1e9 + 7;
void edit() { return; }
void solve() {
  int q, i, j;
  cin >> q;
  vector<int> m(16, -1);
  m[4] = 1;
  m[6] = 1;
  m[8] = 2;
  m[9] = 1;
  m[10] = 2;
  m[12] = 3;
  m[13] = 2;
  m[14] = 3;
  m[15] = 2;
  for (int i = 0; i < q; i++) {
    int n;
    cin >> n;
    if (n <= 15)
      cout << m[n] << "\n";
    else {
      cout << m[12 + n % 4] + (n - 12) / 4 << "\n";
    }
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
