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 long inf = (long long)1e18 + 5;
namespace SOLVE {
void main() {
  long long n = 20;
  vector<long long> dp(n, -1);
  vector<long long> A = {4, 6, 9};
  dp[0] = 0;
  for (long long i = 1; i < n; i++) {
    for (long long a : A) {
      if (i - a >= 0 && dp[i - a] != -1) {
        dp[i] = max(dp[i], dp[i - a] + 1);
      }
    }
  }
  long long q;
  cin >> q;
  for (long long i = 0; i < q; i++) {
    long long x, ans;
    cin >> x;
    if (x >= 16) {
      ans = dp[16 + (x % 4)] + (x - 16) / 4;
    } else {
      ans = dp[x];
    }
    ans = ans >= inf ? -1 : ans;
    cout << ans << endl;
  }
}
}  // namespace SOLVE
signed main() {
  int t;
  t = 1;
  while (t--) {
    SOLVE::main();
  }
  return 0;
}
