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.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		FastScanner in = new FastScanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskA solver = new TaskA();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskA {
		public void solve(int testNumber, FastScanner in, PrintWriter out) {
			if (false) {
				check();
			}
			int numQueries = in.nextInt();
			for (int queryId = 0; queryId < numQueries; queryId++) {
				int n = in.nextInt();
				out.println(solve(n));
			}
		}

		private int solve(int n) {
			if (n == 4 || n == 6) {
				return 1;
			}
			if (n < 8) {
				return -1;
			}
			// n >= 8
			if (n == 11) {
				return -1;
			}
			int r = n % 4;
			if (r == 0 || r == 2) {
				return n / 4;
			}
			return n / 4 - 1;
		}

		private void check() {
			final int N = 100000;
			int[] d = new int[N];
			Arrays.fill(d, -1);
			d[0] = 0;
			for (int i = 4; i < N; i++) {
				for (int j = 4; j <= i; j++) {
					if (isPrime(j)) {
						continue;
					}
					if (d[i - j] != -1) {
						d[i] = Math.max(d[i], d[i - j] + 1);
					}
				}
			}
			for (int i = 1; i < N; i++) {
				int a = d[i];
				int b = solve(i);
				if (a != b) {
					throw new AssertionError(i + " " + a + " " + b);
				}
			}
			System.out.println(d[11] + " " + d[15] + " " + d[19]);
		}

		private boolean isPrime(int n) {
			if (n < 2) {
				return false;
			}
			for (int i = 2; i * i <= n; i++) {
				if (n % i == 0) {
					return false;
				}
			}
			return true;
		}

	}

	static class FastScanner {
		private BufferedReader in;
		private StringTokenizer st;

		public FastScanner(InputStream stream) {
			in = new BufferedReader(new InputStreamReader(stream));
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					String rl = in.readLine();
					if (rl == null) {
						return null;
					}
					st = new StringTokenizer(rl);
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return st.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

	}
}

