#include <bits/stdc++.h>
using namespace std;
const long long maxn = 16;
vector<long long> precompute() {
  vector<long long> dp(maxn, -1);
  dp[0] = 0;
  for (int i = 1; i < maxn; ++i) {
    for (auto j : vector<int>{4, 6, 9}) {
      if (i >= j && dp[i - j] != -1) {
        dp[i] = max(dp[i], dp[i - j] + 1);
      }
    }
  }
  return dp;
}
long long Maximum_Summands(vector<long long> dp, long long n) {
  if (n < maxn)
    return dp[n];
  else {
    long long t = (n - maxn) / 4 + 1;
    return t + dp[n - 4 * t];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long q;
  cin >> q;
  while (q--) {
    long long n;
    cin >> n;
    vector<long long> dp = precompute();
    cout << Maximum_Summands(dp, n) << "\n";
  }
  return 0;
}
