Compact Disk Digital Audio, or CD, are encoded using prime numbers as encryption key. The pirate king of the batch, Sanjay Prajapat, has the CD of his favorite WWE fight clip, featuring Stone Cold scaring the pants off Ronald Krump. He wants to upload the clip to a famous torrent website which features a pirate ship as its symbol. Since uploading the clip requires the CD be decoded, one must know about prime numbers. Sanjay doesn't know how to check whether a number is prime or not. So he took the help of his friend Bissu (the Java Collections God), who unwillingly gave some prime numbers to Sanjay. Thus Sanjay knows some prime numbers less than or equal to N. Since decoding requires bigger prime numbers, Sanjay wants to find how many distinct prime numbers he can make using the sum of at least two consecutive prime numbers less than or equal to N. Help him find the count of such numbers.
T, the number of test cases
Each of the next T lines contain a number N.
For each value of N, output the required number in a new line.
1 <= T <= 1000
1 <= N <= 1000
For first case, N = 5
There are 3 prime numbers less than or equal to 5: 2 , 3 ,5.
Desired prime numbers are : 2+3 = 5
For second case, N = 10
There are 4 prime numbers less than or equal to 10 : 2 , 3 , 5 , 7.
Desired prime numbers are : 2+3 = 5 , 2+3+5+7 =17.
So the answer is 2.