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;
void debug_out() { cerr << endl; }
void clock_out() {
  cerr << "\nTime Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " s\n";
}
void fileio() {
  freopen("/home/dwai/Desktop/cp/input.txt", "r", stdin);
  freopen("/home/dwai/Desktop/cp/output.txt", "w", stdout);
  freopen("/home/dwai/Desktop/cp/debug.txt", "w", stderr);
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << H;
  debug_out(T...);
}
int IT_MAX = 1 << 20;
const long long MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
const double ERR = 1e-10;
long long checkComposite(long long n) {
  long long i;
  if (n == 0) return true;
  for (i = 2; i <= n - 1; i++)
    if (n % i == 0) return true;
  return false;
}
int main() {
  42;
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  srand(time(NULL));
  long long n;
  cin >> n;
  long long i;
  long long dp[21] = {0};
  for (i = 1; i <= 20; i++) {
    long long c = 0;
    long long x = i;
    long long cn = 4;
    while (x) {
      if (cn > x) {
        c = -1;
        break;
      }
      if (checkComposite(cn)) {
        long long ct = x / cn;
        if (checkComposite(x - cn) || dp[x - cn] != -1) {
          x -= cn;
          c++;
        } else
          cn++;
      } else
        cn++;
    }
    dp[i] = c;
    if (checkComposite(i) && dp[i] == -1) dp[i] = 1;
  }
  while (n--) {
    long long q;
    cin >> q;
    if (q <= 20) {
      cout << dp[q] << "\n";
      continue;
    }
    long long x = q / 4;
    long long rem = q - x * 4;
    long long ans = -1;
    while (rem <= 20) {
      if (dp[rem] != -1) {
        ans = dp[rem] + x;
      }
      x--;
      rem += 4;
    }
    cout << ans << "\n";
  }
  return 0;
}
