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 int M = 1e5 + 7;
int n, k;
int c[3] = {4, 6, 9};
int dp[4][100000];
int call(int pos, int s) {
  if (s < 0) return -1e9;
  if (pos == 3) {
    if (s == 0) return 0;
    return -1e9;
  }
  if (dp[pos][s] != -1) return dp[pos][s];
  int p = -1e9, q = -1e9;
  if (s - c[pos] >= 0) p = 1 + call(pos, s - c[pos]);
  q = call(pos + 1, s);
  return dp[pos][s] = max(p, q);
}
void solve() {
  cin >> n;
  int ext = 0;
  if (n > M) {
    int mod = n % 4;
    ext = n / 4;
    ext -= 100;
    n = 4 * 100 + mod;
  }
  int res = call(0, n);
  if (res < 0) res = -1;
  cout << ext + res << "\n";
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0);
  memset(dp, -1, sizeof dp);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
