#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bool isprime(int x) {
  if (x == 0) return false;
  if (x == 1) return true;
  for (int i = 2; i * i <= x; i++)
    if (x % i == 0) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int q = 0;
  cin >> q;
  while (q--) {
    int n;
    cin >> n;
    int ans = -1;
    if (n % 4 == 0) ans = n / 4;
    if ((n - 6) >= 0 && (n - 6) % 4 == 0) ans = max(ans, (n - 6) / 4 + 1);
    if ((n - 9) >= 0 && (n - 9) % 4 == 0) ans = max(ans, (n - 9) / 4 + 1);
    if ((n - 15) >= 0 && (n - 15) % 4 == 0) ans = max(ans, (n - 15) / 4 + 2);
    cout << ans << endl;
  }
  return 0;
}
