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.
// template halnix16


import java.io.*;
import java.util.*;
public class Main {


    static BufferedReader br ;

    public static void main(String[] args) throws Exception{
        // write your code here


        input input = new input();
        int n = input.in();
        while (n-->0){

            long val = input.Lin();
            long time = val/4;
            long mod = val%4;
            if(val==11){
                System.out.println(-1);
                continue;
            }
            if(mod==0){
                System.out.println(time);
                continue;
            }
            long ans =0;
            if(mod==1){
             ans = time-2+1;

            } else if(mod==2){
                ans= time;
             }else{

                ans= time-3+2;
            }
            if(ans<=0){
                System.out.println(-1);
            }else{
                System.out.println(ans);
            }


        }



    }



}

class input{

    BufferedReader br ;
    public input(){
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    int in() throws Exception{
        return Integer.parseInt(br.readLine());
    }

    long Lin() throws Exception{
        return Long.parseLong(br.readLine());


    }
    long Lin(String num) throws Exception{
        return Long.parseLong(num);


    }


    String sin() throws Exception{

        return br.readLine();
    }

    String [] sarrin() throws Exception{

        return br.readLine().split(" ");

    }

    String [] regexSplit() throws Exception{
        return br.readLine().split(" ?(?<!\\G)((?<=[^\\p{Punct}])(?=\\p{Punct})|\\b) ?");
    }
    int in(String num) throws Exception{

        return Integer.parseInt(num);
    }

}
