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.util.Scanner;

/**
 * Created by omka on 11/2/17.
 */
public class C {

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int tmp = 0;
        int ans = 0;
        int abc = 0;
        for (int i = 0; i < n; i++) {
            tmp = in.nextInt();
            ans = -1;
            for (int j = tmp / 4; j >= 0; j--) {
                for (int k = (tmp - 4 * j) / 6; k >= 0; k--) {
                    abc = (tmp - j * 4 - k * 6);
                    if (abc % 9 == 0 && abc >= 0) {
                        ans = j + k + abc / 9;
                        break;
                    }
                }
                if (ans != -1) break;
            }
            System.out.println(ans);
        }

    }

}