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;
long long gcdfun(long long x, long long y) {
  if (y == 0)
    return x;
  else
    return gcdfun(y, x % y);
}
void swap(char* x, char* y) {
  char c;
  c = *x;
  *x = *y;
  *y = c;
}
long long minfun(long long x, long long y) {
  if (x > y)
    return y;
  else
    return x;
}
void solve() {
  int n;
  cin >> n;
  if (n % 4 == 0) {
    cout << n / 4;
    return;
  }
  if (n % 4 == 1) {
    if (n < 9) {
      cout << -1;
      return;
    } else {
      cout << (n - 9) / 4 + 1;
      return;
    }
  }
  if (n % 4 == 2) {
    if (n < 6) {
      cout << -1;
      return;
    } else {
      cout << (n - 6) / 4 + 1;
      return;
    }
  }
  if (n % 4 == 3) {
    if (n < 15) {
      cout << -1;
    } else
      cout << (n - 15) / 4 + 2;
    return;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
    cout << '\n';
  }
  return 0;
}
