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;
typedef struct _node {
  struct _node* L;
  struct _node* R;
  long long int key;
} tree;
typedef tree* treenode;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int q, n;
  cin >> q;
  while (q--) {
    long long int ans = -1;
    cin >> n;
    if (n > 15) {
      ans = n / 4;
      long long int d = n % 4;
      if (d == 1)
        ans--;
      else if (d == 3)
        ans--;
    } else if (n == 4 || n == 6 || n == 9)
      ans = 1;
    else if (n == 8 || n == 10 || n == 13 || n == 15)
      ans = 2;
    else if (n == 12 || n == 14)
      ans = 3;
    cout << ans << endl;
  }
  return 0;
}
