Problem: 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.

Solution (in PYTHON):

Solution:
l='5 7 13 19 31 43 61 73 103 109 139 151 181 193 199 229 241 271 283 313 349 421 433 463 523 571 601 619 643 661 811 823 829 859 883 1021 1033 1051 1063 1093 1153 1231 1279 1291 1303 1321 1429 1453 1483 1489 1609 1621 1669 1699 1723 1789 1873 1879 1933 1951 1999 2029 2083 2089 2113 2131 2143 2239 2269 2311 2341 2383 2551 2593 2659 2689 2713 2731 2791 2803 2971 3001 3121 3169 3253 3259 3301 3331 3361 3373 3391 3463 3469 3529 3541 3559 3583 3673 3769 3823 3853 3919 3931 4003 4021 4051 4093 4129 4159 4219 4231 4243 4261 4273 4339 4423 4483 4519 4549 4639 4651 4723 4789 4801 4933 4969 5011 5023 5101 5233 5281 5419 5443 5479 5503 5521 5641 5653 5659 5743 5851 5869 5881 6091 6133 6199 6271 6301 6361 6451 6553 6571 6661 6691 6703 6763 6781 6793 6829 6871 6949 6961 7129 7213 7309 7333 7351 7459 7489 7549 7561 7591 7759 7879 7951 8011 8089 8221 8233 8293 8389 8431 8539 8599 8629 8821 8839 8863 8971 9001 9013 9043 9241 9283 9343 9421 9433 9439 9463 9631 9679 9721 9769 9859 9931';
l=[int(i) for i in l.split(' ')];
t=int(raw_input());
while t!=0:
	t-=1;
	n=int(raw_input());
	for i in l:
		if i>n:
			break;
		else:
			print i,
	print