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.*;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int mas[] = new int[n];
        int ans[] = new int[n];
        int max = 0;
        int a;
        for (int i = 0; i < n; i++) {
            a = sc.nextInt();
            if (a % 4 == 0 || a % 4 == 2) {
                mas[i] = a / 4;
                ans[i] = a;
            } else {
                mas[i] = a / 4 - 1;
                ans[i] = a;
            }
        }
        for (int i = 0; i < n; i++) {
            if(ans[i] >=4 && ans[i] != 5 && ans[i] != 7 && ans[i] != 11){
                System.out.println(mas[i]);
            }
            else {
                System.out.println(-1);
            }
        }



    }

    static class TimeLine implements Comparable<TimeLine> {
        int a;
        int type;

        public TimeLine(int a, int type) {
            this.a = a;
            this.type = type;
        }

        @Override
        public int compareTo(TimeLine o) {
            if (a != o.a) return a - o.a;
            return type - o.type;
        }
    }
}
