#include <bits/stdc++.h>
using namespace std;
template <class T, class T1>
inline int lower(const T& v, T1 x) {
  return lower_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T, class T1>
inline int upper(const T& v, T1 x) {
  return upper_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T>
inline T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
};
template <class T>
inline T pw(T a, T p, T M) {
  T result = 1;
  for (T sq = a; p; p >>= 1, sq = (sq * 1ll * sq) % M) {
    if (p & 1) {
      result = result * 1ll * sq % M;
    }
  }
  return result;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& a) {
  os << "(" << a.first << "," << a.second << ")";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const vector<T1, T2>& a) {
  bool f = 0;
  os << "[";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "]";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const set<T1, T2>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "}";
  return os;
}
template <class T1, class T2, class T3>
ostream& operator<<(ostream& os, const map<T1, T2, T3>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x.first << ":" << x.second;
  }
  os << "}";
  return os;
}
struct _ {
  _() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(30);
    cout << fixed;
  }
};
int main() {
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int n;
    cin >> n;
    if (n <= 3) {
      cout << -1 << endl;
    } else {
      int result = 0;
      if (n % 2 != 0) {
        n -= 9;
        result++;
      }
      if (n < 0 || n == 2) {
        cout << -1 << endl;
      } else {
        result += n / 4;
        cout << result << endl;
      }
    }
  }
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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;
template <class T, class T1>
inline int lower(const T& v, T1 x) {
  return lower_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T, class T1>
inline int upper(const T& v, T1 x) {
  return upper_bound((v).begin(), (v).end(), x) - v.begin();
}
template <class T>
inline T gcd(T a, T b) {
  return a ? gcd(b % a, a) : b;
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
};
template <class T>
inline T pw(T a, T p, T M) {
  T result = 1;
  for (T sq = a; p; p >>= 1, sq = (sq * 1ll * sq) % M) {
    if (p & 1) {
      result = result * 1ll * sq % M;
    }
  }
  return result;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& a) {
  os << "(" << a.first << "," << a.second << ")";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const vector<T1, T2>& a) {
  bool f = 0;
  os << "[";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "]";
  return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const set<T1, T2>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x;
  }
  os << "}";
  return os;
}
template <class T1, class T2, class T3>
ostream& operator<<(ostream& os, const map<T1, T2, T3>& a) {
  bool f = 0;
  os << "{";
  for (auto& x : a) {
    if (f) os << ",";
    f = 1;
    os << x.first << ":" << x.second;
  }
  os << "}";
  return os;
}
struct _ {
  _() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(30);
    cout << fixed;
  }
};
int main() {
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int n;
    cin >> n;
    if (n <= 3) {
      cout << -1 << endl;
    } else {
      int result = 0;
      if (n % 2 != 0) {
        n -= 9;
        result++;
      }
      if (n < 0 || n == 2) {
        cout << -1 << endl;
      } else {
        result += n / 4;
        cout << result << endl;
      }
    }
  }
  return 0;
}

```