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.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    
    public static long mod = 1000000007;
 
    public static void sieve(boolean[] isPrime, int n) {
		for (int i = 1; i < n; i++)
			isPrime[i] = true;

		isPrime[0] = false;
		isPrime[1] = false;

		for (int i = 2; i * i < n; i++) {
			if (isPrime[i] == true) {
				for (int j = (2 * i); j < n; j += i)
					isPrime[j] = false;
			}
		}
	}
   
    
 public static void main(String[] args) throws IOException{

     
     
    // BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
     PrintWriter  pw = new PrintWriter(System.out);
     Scanner in = new Scanner(System.in);
   
     
     int n = in.nextInt();
    
     boolean[] isp = new boolean[40];
     sieve(isp, 35);
     int[] dp = new int[30];
     dp[0] = -1;
     dp[1] = -1;
     dp[2] = -1;
     dp[3] = -1;
     dp[10] = 2;
     dp[19] = 3;
     dp[14] = 3;
     dp[18] = 4;
     dp[15] = 2;
     
     for(int i=4; i<30 ;i++)
     {
         if(dp[i]==0 )
         {
             if(!isp[i])
             {
                 dp[i] = 1;
             for(int j=2*i; j<30; j += i)
             {
                 dp[j] = Math.max(dp[j-i] +dp[i], dp[j]);
             }
             }
             else
             
                 dp[i] = -1;
         }
         
     }
     
    dp[0] = 0;
     for(int i=0; i<n; i++)
     {
         
         int num = in.nextInt();
         int ans = -1;
         for(int j=0; j<30 && num-j>=0; j++)
         {
             
             int tmp = -1;
             
             if((num-j)%4==0 && dp[j]!=-1)
             {
             //   pw.println(j+"_-");   
                tmp = (num-j)/4 + dp[j];
             }
            ans = Math.max(ans,tmp);
             
             
         }
        pw.println(ans);         
         
     }
     
     
   
  
     pw.flush();
     pw.close();
     
   }
}
