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>
#pragma GCC optimize("Ofast")
using namespace std;
bool isprime(long long int n) {
  if (n <= 1) return false;
  for (long long int i = 2; i * i <= n; ++i)
    if (n % i == 0) return false;
  return true;
}
long long int expo(long long int a, long long int n) {
  if (n == 0) return 1;
  if (n == 1) return a;
  long long int tmp = expo(a, n / 2);
  tmp = (tmp * tmp) % (long)(1e9 + 7);
  if (n & 1) tmp = (tmp * a) % (long)(1e9 + 7);
  return tmp;
}
void manupulate(string &str) {
  for (long long int i = 0; i < str.size(); ++i) str[i] -= 48;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int t;
  cin >> t;
  while (t--) {
    long long int x;
    cin >> x;
    ;
    long long int y = x % 4;
    bool flag = false;
    if (y == 0)
      cout << x / 4;
    else if (y == 1 || y == 3) {
      long long int z = x / 9;
      if (z == 0)
        flag = true;
      else {
        long long int c = 1;
        x -= 9;
        if (x % 4 == 0)
          cout << c + x / 4;
        else if (x <= 2)
          flag = true;
        else
          cout << 2 + (x - 6) / 4;
      }
    } else if (y == 2) {
      long long int z = x / 6;
      if (z == 0)
        flag = true;
      else
        cout << 1 + ((x - 6) / 4);
    } else
      flag = true;
    if (flag) cout << -1;
    cout << "\n";
  }
  return 0;
}
