mike-the-bully-3
Source: hackerearth
Difficulty: EASY

Chester Bennington, being a skinny kid as we all know, is always bullied since he was a child. This time its just unacceptable. Mike Shinoda, the second vocalist to his band, tried to bully him. Chester was never a bright student and Mike, being a high school graduate, gave him a tough mathematical problem. He gave Chester a number N. His task is to find all the prime numbers under N(inclusive) which can be written as the sum of two primes and list them.

Help Chester so that this time he is not bullied....... Again !!!

Input: First line contains t, the number of test cases. t lines follow after that which contain an integer N.

Output: For each test case, you have to print all the prime numbers that meet the above mentioned condition in a single line in a space separated format. For each test-case use a new line.

Constraints:

1 ≤ t ≤ 100

1 ≤ N ≤ 10000

Note: 1 and 0 are not considered Primes

Problem Setter: Rohit Mishra

SAMPLE INPUT
3
7
17
29

SAMPLE OUTPUT
5 7
5 7 13
5 7 13 19

Explanation

Consider test case - 2
N=17
Prime Numbers under 17 are 2,3,5,7,11,13,17
Output is 5,7,13

As 1+10 = 2+9 = 3+8 = 4+7 = 5+6 = 11
None of the above mentioned pairs meets the required criteria.
Same is the case with the other numbers which are not mentioned in the output.


'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
import math
question = []
primes = []
t = int(input())
while t > 0:
	n = int(input())
	question.append(n)
	t -= 1
	
maxi = max(question)
j = 2
while j <= maxi:
	k = 2
	z = 0
	while k <= math.sqrt(j):
		if j%k == 0:
			z = 1
			break;
		k += 1
	if z == 0:
		primes.append(j)
	j += 1
	
l = []
for j in primes:
	for k in primes:
		if k <= j: continue
		if k+j > maxi: break
		if k+j in primes:
			if k+j not in l:
				l.append(k+j)

for i in question:
	t = [x for x in l if x <= i]
	print(' '.join(map(str,t)))
#print primes