#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007LL;
long long base = 10000007;
long long large = 1000000000000000000LL;
bitset<10000000> vis;
vector<int> primes;
void sieve(long long n) {
  vis.set();
  vis[0] = 0;
  vis[1] = 0;
  for (long long i = 2; i <= n; i++) {
    if (vis[i]) {
      for (long long j = i * i; j <= n; j += i) {
        vis[j] = 0;
      }
      primes.push_back((int)i);
    }
  }
}
int main() {
  sieve(1000000);
  int q;
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    int temp = x / 4;
    if (x % 4 > 0) {
      if (x % 4 == 1) {
        temp -= 1;
      }
      if (x % 4 == 3) {
        if (x == 7 || x == 11) {
          cout << -1 << endl;
          continue;
        }
        temp -= 1;
      }
    }
    if (temp <= 0) temp = -1;
    cout << temp << endl;
  }
  return 0;
}

### Prompt

Create a solution in cpp for the following problem:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007LL;
long long base = 10000007;
long long large = 1000000000000000000LL;
bitset<10000000> vis;
vector<int> primes;
void sieve(long long n) {
  vis.set();
  vis[0] = 0;
  vis[1] = 0;
  for (long long i = 2; i <= n; i++) {
    if (vis[i]) {
      for (long long j = i * i; j <= n; j += i) {
        vis[j] = 0;
      }
      primes.push_back((int)i);
    }
  }
}
int main() {
  sieve(1000000);
  int q;
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    int temp = x / 4;
    if (x % 4 > 0) {
      if (x % 4 == 1) {
        temp -= 1;
      }
      if (x % 4 == 3) {
        if (x == 7 || x == 11) {
          cout << -1 << endl;
          continue;
        }
        temp -= 1;
      }
    }
    if (temp <= 0) temp = -1;
    cout << temp << endl;
  }
  return 0;
}

```