Today the kindergarten has a new group of $n$ kids who need to be seated at the dinner table. The chairs at the table are numbered from $1$ to $4n$. Two kids can't sit on the same chair. It is known that two kids who sit on chairs with numbers $a$ and $b$ ($a \neq b$) will indulge if:   $gcd(a, b) = 1$ or,  $a$ divides $b$ or $b$ divides $a$. 

$gcd(a, b)$ — the maximum number $x$ such that $a$ is divisible by $x$ and $b$ is divisible by $x$.

For example, if $n=3$ and the kids sit on chairs with numbers $2$, $3$, $4$, then they will indulge since $4$ is divided by $2$ and $gcd(2, 3) = 1$. If kids sit on chairs with numbers $4$, $6$, $10$, then they will not indulge.

The teacher really doesn't want the mess at the table, so she wants to seat the kids so there are no $2$ of the kid that can indulge. More formally, she wants no pair of chairs $a$ and $b$ that the kids occupy to fulfill the condition above.

Since the teacher is very busy with the entertainment of the kids, she asked you to solve this problem.


-----Input-----

The first line contains one integer $t$ ($1 \leq t \leq 100$) — the number of test cases. Then $t$ test cases follow.

Each test case consists of one line containing an integer $n$ ($1 \leq n \leq 100$) — the number of kids.


-----Output-----

Output $t$ lines, which contain $n$ distinct integers from $1$ to $4n$ — the numbers of chairs that the kids should occupy in the corresponding test case. If there are multiple answers, print any of them. You can print $n$ numbers in any order.


-----Example-----
Input
3
2
3
4

Output
6 4
4 6 10
14 10 12 8

Source: codeforces | Difficulty: EASY
Tags: Mathematics

Constructive algorithms


Solutions:
import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	n = int(input())
	print(' '.join(list(map(str, list(range(2 * n + 2, 4 * n + 1, 2))))))


for _ in range(int(input())):
	n = int(input())
	print(*[2 * i + 2 * n + 2 for i in range(n)])


for _ in range(int(input())):
	n = int(input())
	for i in range(0, n * 2, 2):
		print(4 * n - 2 - i, end=' ')
	print()


t = int(input())
for i in range(t):
	n = int(input())
	if n == 1:
		print(2)
	else:
		a = 2
		for i in range(n):
			print(a + n * 2, end=' ')
			a += 2
		print()


def f(n: int):
	for i in range(n):
		a = 4 * n - 2 - 2 * i
		print(a)
t = int(input())
for i in range(t):
	n = int(input())
	f(n)


t = int(input())
for _ in range(t):
	n = int(input())
	arr = []
	for i in range(2 * n, 4 * n, 2):
		arr += [i]
	print(*arr)


for _ in range(int(input())):
	n = int(input())
	b = [4 * n - 2 * i for i in range(n)]
	print(*b)


t = int(input())
n = []
for _ in range(t):
	n.append(int(input()))
if t == 1 and n[0] == 1:
	print(1)
else:
	for i in n:
		k = 4 * i
		for j in range(i):
			print(k, end=' ')
			k -= 2
		print()


test = int(input())
while test > 0:
	test -= 1
	n = int(input())
	arr = []
	a = 2
	for i in range(n + 1, 2 * n + 1):
		arr.append(i)
	for i in range(len(arr)):
		print(2 * arr[i], end=' ')
	print()


from collections import Counter
import math
import sys
import heapq
from bisect import bisect, bisect_left, bisect_right

def input():
	return sys.stdin.readline().strip()

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def mod():
	return 10 ** 9 + 7
arr = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887]
for i in range(INT()):
	n = INT()
	x = 4 * n
	ans = []
	while n > 0:
		ans.append(x)
		x -= 2
		n -= 1
	print(*ans)


from math import gcd
for _ in range(int(input())):
	n = int(input())
	a = set()
	for i in range(4 * n, 3, -1):
		f = 0
		if a:
			for each in a:
				if each % i == 0 or i % each == 0 or gcd(each, i) == 1:
					f = 1
					break
		if not f:
			a.add(i)
		if len(a) == n:
			break
	print(*a)


for _ in range(int(input())):
	n = int(input())
	temp = []
	ini = n * 2
	for i in range(n):
		temp.append(ini)
		ini += 2
	print(*temp)


import sys
input = sys.stdin.readline
(inp, ip) = (lambda : int(input()), lambda : [int(w) for w in input().split()])
for i in range(inp()):
	n = inp()
	ans = [i for i in range(4 * n, 2 * n, -2)]
	print(*ans)


t = int(input())
for _ in range(t):
	n = int(input())
	l = []
	for i in range(4 * n, 1, -2):
		l.append(i)
		if len(l) == n:
			break
	print(*l)


t = int(input())
while t:
	n = int(input())
	a = []
	for i in range(n * 4, n * 2, -2):
		a.append(i)
		if len(a) == n:
			break
	print(*a)
	t -= 1


from sys import stdin
input = stdin.readline
t = int(input())
for i in range(t):
	n = int(input())
	for i in range(n):
		print(4 * n - 2 * i, end=' ')
	print()


import math
import sys

class Read:

	@staticmethod
	def string():
		return input()

	@staticmethod
	def int():
		return int(input())

	@staticmethod
	def list(sep=' '):
		return input().split(sep)

	@staticmethod
	def list_int(sep=' '):
		return list(map(int, input().split(sep)))

def solve():
	n = Read.int()
	v = n * 4
	res = []
	for i in range(n):
		res.append(str(v))
		v -= 2
	print(' '.join(res))
query_count = Read.int()
while query_count:
	query_count -= 1
	solve()


import os
import sys
from io import BytesIO, IOBase
import math

def main():
	pass
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def binary(n):
	return bin(n).replace('0b', '')

def decimal(s):
	return int(s, 2)

def pow2(n):
	p = 0
	while n > 1:
		n //= 2
		p += 1
	return p

def primeFactors(n):
	l = []
	while n % 2 == 0:
		l.append(2)
		n = n / 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			l.append(i)
			n = n / i
	if n > 2:
		l.append(int(n))
	return l

def isPrime(n):
	if n == 1:
		return False
	else:
		root = int(n ** 0.5)
		root += 1
		for i in range(2, root):
			if n % i == 0:
				return False
		return True

def maxPrimeFactors(n):
	maxPrime = -1
	while n % 2 == 0:
		maxPrime = 2
		n >>= 1
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			maxPrime = i
			n = n / i
	if n > 2:
		maxPrime = n
	return int(maxPrime)

def countcon(s, i):
	c = 0
	ch = s[i]
	for i in range(i, len(s)):
		if s[i] == ch:
			c += 1
		else:
			break
	return c

def fact(n):
	m = 1000000007
	f = 1
	if n == 0:
		return 1
	else:
		for i in range(1, n + 1):
			f = f * i
			f %= m
		return int(f)
for xyz in range(0, int(input())):
	n = int(input())
	f = n
	n = 4 * n
	while f:
		print(n, end=' ')
		n -= 2
		f -= 1
	print('')


for _ in range(int(input())):
	n = int(input())
	a1 = 4 * n
	a = []
	for i in range(n):
		a.append(a1)
		a1 -= 2
	print(*list(reversed(a)))


for _ in range(int(input())):
	n = int(input())
	if n == 1:
		print(2)
	else:
		st = 4
		while st < 4 * n:
			t = st
			l = []
			while t < 4 * n:
				f = 0
				if t == st:
					l.append(st)
				elif t % st != 0:
					for i in l:
						if t % i == 0:
							f += 1
							break
					if f == 0:
						l.append(t)
				if f != 0:
					break
				t += 2
			if len(l) == n:
				break
			else:
				st += 2
		print(*l)


t = int(input())
for _ in range(t):
	n = int(input())
	k = 2 * n
	for i in range(n):
		print(k, end=' ')
		k += 2
	print()


t = int(input())
while t:
	t -= 1
	n = int(input())
	x = 4 * n - 2
	for i in range(n):
		print(x, end=' ')
		x -= 2
	print()


t = int(input())

def solve(n):
	for i in range(n + 1, 2 * n):
		print(2 * i, end=' ')
	print(4 * n)
for i in range(t):
	n = int(input())
	solve(n)


T = int(input())
for i in range(T):
	n = int(input())
	for j in range(n):
		print(4 * n - 2 * j, end=' ')
	print()


T = int(input())
for t in range(T):
	n = int(input())
	c = n * 2
	if c % 2:
		c = n + 1
	l = list()
	for i in range(n):
		l.append(c)
		c += 2
	print(' '.join(map(str, l)))


def kids(n):
	a = []
	for i in range(n):
		a.append(4 * n - 2 * i)
	return a
t = int(input())
for i in range(t):
	n = int(input())
	print(*kids(n))


import math
for _ in range(int(input())):
	n = int(input())
	l = []
	for i in range(2 * n + 2, 4 * n + 1, 2):
		l.append(i)
	print(*l)


import math
for t in range(int(input())):
	n = int(input())
	li = list()
	tr = 4 * n
	li.append(tr)
	while len(li) < n:
		while tr >= 1:
			if math.gcd(tr, li[-1]) not in [1, tr, li[-1]]:
				li.append(tr)
				break
			else:
				tr -= 1
		tr -= 1
	li = li[::-1]
	for data in li:
		print(data, end=' ')
	print()


for t in range(int(input())):
	n = int(input())
	s = 2 * n
	a = []
	a.append(s)
	for i in range(n - 1):
		s += 2
		a.append(s)
	print(*a, sep=' ')


for y in range(int(input())):
	n = int(input())
	t = 4 * n
	for i in range(n):
		t -= 2
		print(t, end=' ')
	print()


for t in range(int(input())):
	n = int(input())
	ans = []
	for i in range(n * 2, n * 4, 2):
		ans.append(i)
	print(*ans)


def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		p = []
		for i in range(n):
			p.append(4 * n - i * 2)
		print(*p)
main()


import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__

def gift():
	for _ in range(t):
		n = int(input())
		ans = []
		for i in range(n):
			ans.append(n * 4 - (i + 1) * 2)
		yield ' '.join((str(x) for x in ans))
t = int(input())
ans = gift()
print(*ans, sep='\n')


from sys import stdin, stdout
from math import factorial as f
from random import randint, shuffle
input = stdin.readline
for _ in range(int(input())):
	n = int(input())
	for i in range(2 * n + 2, 4 * n + 1, 2):
		print(i)


for _ in ' ' * int(input()):
	n = int(input())
	x = 4 * n
	for _ in ' ' * n:
		print(x, end=' ')
		x -= 2
	print()


t = int(input())
for case in range(t):
	n = int(input())
	ans = [2 * n + 2 * i + 2 for i in range(n)]
	print(*ans)


import math
t = int(input())
for tt in range(t):
	n = int(input())
	for i in range(4 * n, 2 * n, -2):
		print(i, end=' ')
	print()


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def update(bit, i):
	while i < len(bit):
		bit[i] += 1
		i += i & -i

def getsum(bit, i):
	res = 0
	while i > 0:
		res += bit[i]
		i -= i & -i
	return res
for _ in range(int(input())):
	n = int(input())
	if n == 1:
		print(1)
	else:
		ls = []
		flag = 0
		for st in range(4, 4 * n + 1, 2):
			ls = []
			for i in range(st, 4 * n + 1):
				if len(ls) == n:
					flag = 1
					break
				elif i % 2 == 0:
					f = 0
					for j in ls:
						if i % j == 0:
							f = 1
					if f == 0:
						ls.append(i)
			if flag == 1 or len(ls) == n:
				break
		print(*ls)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def input():
	return sys.stdin.readline().rstrip('\r\n')
for _ in range(int(input())):
	n = int(input())
	if n == 1:
		print(2)
	else:
		p = n * 4
		for i in range(n):
			print(p, end=' ')
			p = p - 2
		print()


from sys import stdin
from math import gcd
input = lambda : stdin.readline().strip()
wtf = int(input())
for i in range(wtf):
	n = int(input())
	resh = [0] * (4 * n + 1)
	ans = []
	for i in range(4, 4 * n + 1, 2):
		cnt = 0
		ind = 0
		for k in range(len(ans)):
			j = ans[k]
			if i % j == 0 or gcd(i, j) == 1:
				cnt += 1
				ind = k
		if cnt == 1:
			ans[ind] = i
		elif cnt == 0:
			ans.append(i)
	print(*ans[:n])


a = int(input())
for i in range(a):
	n = int(input())
	print(*range(4 * n, 2 * n, -2))


t = int(input())
while t:
	n = int(input())
	for p in range(4 * n, 2 * n, -2):
		print(p, sep=' ', end=' ')
	print()
	t -= 1


t = int(input())
while t > 0:
	r = int(input())
	y = r
	res = []
	v = 0
	r *= 4
	while y > 0:
		res.append(r)
		r -= 2
		y -= 1
	print(' '.join((str(x) for x in res)))
	t -= 1


for t in range(int(input())):
	n = int(input())
	c = 0
	if n % 2 == 1:
		c = 1
		n = n - 1
	a = []
	x = 2 * n
	for i in range(n):
		a.append(x)
		x = x + 2
	if c == 1:
		a.append(x + 2)
	for i in range(len(a)):
		print(a[i], end=' ')
	print()


from sys import stdin
_input = stdin.readline
(_range, _int) = (range, int)

def solution():
	for _ in _range(_int(_input())):
		n = _int(_input())
		ans = []
		for i in _range(n, 2 * n):
			ans.append(i * 2)
		print(*ans)
solution()


n = int(input())
for w in range(n):
	a = int(input())
	z = a
	for i in range(a):
		print((z + i) * 2, end=' ')
	print()


for _ in range(int(input())):
	n = int(input())
	k = 0
	i = n
	while k != n:
		print(2 * i, end=' ')
		i += 1
		k += 1
	print()


t = int(input())
for i in range(t):
	n = int(input())
	for j in range(2 * n + 2, 4 * n + 1, 2):
		print(j, end=' ')
	print()


for test in range(int(input())):
	n = int(input())
	print(*[x for x in range(2 * n, 4 * n, 2)])


from math import gcd
for i in range(int(input())):
	n = int(input())
	k = n
	n = n * 4
	l = []
	for i in range(2 * k, n, 2):
		l.append(i)
	print(*l)


for i in range(int(input())):
	n = int(input())
	l = []
	l.append(2 * n)
	for i in range(1, n):
		count = 0
		a = 2 * n + 2 * i
		for num in l:
			if a % num == 0:
				count += 1
		if count == 0:
			l.append(a)
	for num in l:
		print(num, end=' ')


t = int(input())
for i in range(t):
	arr = []
	n = int(input())
	for i in range(n):
		arr.append(n * 4 - (i + 1) * 2)
	print(*arr)


for _ in range(int(input())):
	n = int(input())
	ans = [*range(4 * n, 3, -2)][:n]
	print(*ans)


for _ in range(int(input())):
	n = int(input())
	t = 4 * n
	z = []
	for i in range(n):
		z.append(t)
		t -= 2
	print(*z)


t = int(input())
for i in range(t):
	n = int(input())
	res = []
	for j in range(2 * n + 2, 4 * n + 1, 2):
		res.append(j)
	print(' '.join(map(str, res)))


import math
import sys, bisect
from heapq import *
from itertools import *
from collections import *
sys.setrecursionlimit(10 ** 6)
I = lambda : int(sys.stdin.readline())
neo = lambda : map(int, sys.stdin.readline().split())
Neo = lambda : list(map(int, sys.stdin.readline().split()))
for _ in range(I()):
	n = I()
	p = n
	for i in range(2 * n, 4 * n, 2):
		if p == 0:
			break
		print(i, end=' ')
		p -= 1
	print()


from collections import Counter
from collections import OrderedDict
from collections import defaultdict
import bisect
import math

def freq_count(mylist):
	return Counter(mylist)

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)
t = int(input())
for _ in range(t):
	n = int(input())
	num = n * 4
	for i in range(n):
		print(num, end=' ')
		num -= 2
	print()


t = int(input())
for _ in range(t):
	n = int(input())

	def solve():
		result = []
		for i in range(n, 100000):
			if len(result) >= n:
				return result
			addToResult = True
			curr = 2 * i
			for num in result:
				if curr % num == 0:
					addToResult = False
			if addToResult:
				result.append(curr)
		assert False
	result = solve()
	print(' '.join(map(str, result)))


import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log2, ceil
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
from bisect import insort
from collections import Counter
from collections import deque
from heapq import heappush, heappop, heapify
from itertools import permutations, combinations
mod = int(1000000000.0) + 7
ip = lambda : int(stdin.readline())
inp = lambda : map(int, stdin.readline().split())
ips = lambda : stdin.readline().rstrip()
out = lambda x: stdout.write(str(x) + '\n')
t = ip()
for _ in range(t):
	n = ip()
	nn = 4 * n
	stack = []
	for i in range(nn, 0, -1):
		if i % 2 == 0:
			flag = True
			for j in stack:
				if i % j == 0:
					flag = False
			if flag:
				stack.append(i)
	ans = stack[:n]
	print(*ans)


for _ in range(int(input())):
	n = int(input())
	ans = []
	i = 0
	while len(ans) < n:
		ans.append(2 * n + i)
		i += 2
	print(*ans)


t = int(input())
while t > 0:
	t -= 1
	a = int(input())
	for i in range(0, 2 * a - 1, 2):
		print(i + 2 * a + 2, end=' ')
	print()


for _ in range(int(input())):
	nos = int(input())
	print(*list(range(nos * 4, nos * 4 - nos * 2, -2)))


from bisect import *
from collections import *
from math import gcd, ceil, sqrt, floor, inf
from heapq import *
from itertools import *
from operator import add, mul, sub, xor, truediv, floordiv
from functools import *
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())
farr = [1]
ifa = []

def fact(x, mod=0):
	if mod:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr) % mod)
	else:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr))
	return farr[x]

def ifact(x, mod):
	global ifa
	ifa.append(pow(farr[-1], mod - 2, mod))
	for i in range(x, 0, -1):
		ifa.append(ifa[-1] * i % mod)
	ifa = ifa[::-1]

def per(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return fact(i) // fact(i - j)
	return farr[i] * ifa[i - j] % mod

def com(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return per(i, j) // fact(j)
	return per(i, j, mod) * ifa[j] % mod

def catalan(n):
	return com(2 * n, n) // (n + 1)

def linc(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t > f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rinc(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t < f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def ldec(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t < f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rdec(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t > f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def isprime(n):
	for i in range(2, int(n ** 0.5) + 1):
		if n % i == 0:
			return False
	return True

def binfun(x):
	c = 0
	for w in arr:
		c += ceil(w / x)
	return c

def lowbit(n):
	return n & -n

def inverse(a, m):
	a %= m
	if a <= 1:
		return a
	return (1 - inverse(m, a) * m) // a % m

class BIT:

	def __init__(self, arr):
		self.arr = arr
		self.n = len(arr) - 1

	def update(self, x, v):
		while x <= self.n:
			self.arr[x] += v
			x += x & -x

	def query(self, x):
		ans = 0
		while x:
			ans += self.arr[x]
			x &= x - 1
		return ans

class smt:

	def __init__(self, l, r, arr):
		self.l = l
		self.r = r
		self.value = (1 << 31) - 1 if l < r else arr[l]
		mid = (l + r) // 2
		if l < r:
			self.left = smt(l, mid, arr)
			self.right = smt(mid + 1, r, arr)
			self.value &= self.left.value & self.right.value

	def setvalue(self, x, val):
		if self.l == self.r:
			self.value = val
			return
		mid = (self.l + self.r) // 2
		if x <= mid:
			self.left.setvalue(x, val)
		else:
			self.right.setvalue(x, val)
		self.value = self.left.value & self.right.value

	def ask(self, l, r):
		if l <= self.l and r >= self.r:
			return self.value
		val = (1 << 31) - 1
		mid = (self.l + self.r) // 2
		if l <= mid:
			val &= self.left.ask(l, r)
		if r > mid:
			val &= self.right.ask(l, r)
		return val

class DSU:

	def __init__(self, n):
		self.c = [-1] * n

	def same(self, x, y):
		return self.find(x) == self.find(y)

	def find(self, x):
		if self.c[x] < 0:
			return x
		self.c[x] = self.find(self.c[x])
		return self.c[x]

	def union(self, u, v):
		(u, v) = (self.find(u), self.find(v))
		if u == v:
			return False
		if self.c[u] < self.c[v]:
			(u, v) = (v, u)
		self.c[u] += self.c[v]
		self.c[v] = u
		return True

	def size(self, x):
		return -self.c[self.find(x)]

class UFS:

	def __init__(self, n):
		self.parent = [i for i in range(n)]
		self.ranks = [0] * n

	def find(self, x):
		if x != self.parent[x]:
			self.parent[x] = self.find(self.parent[x])
		return self.parent[x]

	def union(self, u, v):
		(pu, pv) = (self.find(u), self.find(v))
		if pu == pv:
			return False
		if self.ranks[pu] >= self.ranks[pv]:
			self.parent[pv] = pu
			if self.ranks[pv] == self.ranks[pu]:
				self.ranks[pu] += 1
		else:
			self.parent[pu] = pv

def Prime(n):
	c = 0
	prime = []
	flag = [0] * (n + 1)
	for i in range(2, n + 1):
		if not flag[i]:
			prime.append(i)
			c += 1
		for j in range(c):
			if i * prime[j] > n:
				break
			flag[i * prime[j]] = prime[j]
			if i % prime[j] == 0:
				break
	return prime

def dij(s, graph):
	d = {}
	d[s] = 0
	heap = [(0, s)]
	seen = set()
	while heap:
		(dis, u) = heappop(heap)
		if u in seen:
			continue
		for v in graph[u]:
			if v not in d or d[v] > d[u] + graph[u][v]:
				d[v] = d[u] + graph[u][v]
				heappush(heap, (d[v], v))
	return d

def GP(it):
	res = []
	for (ch, g) in groupby(it):
		res.append((ch, len(list(g))))
	return res
t = N()
for i in range(t):
	n = N()
	ans = [i for i in range(2 * n + 2, 4 * n + 2, 2)]
	print(*ans)


def solve():
	n = int(input())
	ban = set()
	a = []
	cur = 4 * n
	while len(a) < n:
		while cur in ban:
			cur -= 2
		a.append(cur)
		for i in range(2, cur + 1):
			if i % cur == 0:
				ban.add(i)
	print(*a)
t = int(input())
for _ in range(t):
	solve()


for _ in range(int(input())):
	n = int(input())
	start = 4 + (n - 1) * 2
	for _ in range(n):
		print(start, end=' ')
		start += 2
	print('\n')


for _ in range(int(input())):
	n = int(input())
	l = []
	x = n * 2
	while len(l) < n:
		l.append(x)
		x += 2
	print(*l)


mod = 10 ** 9 + 7

def solve():
	n = int(input())
	p = 4
	cnt = 0
	for i in range(4 * n, 2 * n, -2):
		print(i, end=' ')
	print()
t = 1
t = int(input())
while t > 0:
	solve()
	t -= 1


for tc in range(int(input())):
	n = int(input())
	results = []
	for i in range(4 * n - 2, 0, -2):
		flag = True
		for j in results:
			if int(j) % i == 0:
				flag = False
		if flag:
			results.append(str(i))
		if len(results) == n:
			break
	ans = ' '.join(results)
	print(ans)


t = int(input())
for i in range(t):
	n = int(input())
	x = 4 * n
	for j in range(n):
		print(x)
		x -= 2


for _ in range(int(input())):
	n = int(input())
	ans = [4 * n]
	for i in range(1, n):
		ans.append(4 * n - 2 * i)
	print(*ans)


test = int(input())
for _ in range(test):
	n = int(input())
	for i in range(n):
		print(2 * n + i * 2, end=' ')
	print()


import math, sys
from collections import defaultdict, Counter, deque
from functools import reduce
INF = float('inf')
MOD = int(1000000000.0) + 7

def solve():
	n = int(input())
	i = 2 * n
	while n:
		print(i, end=' ')
		i += 2
		n -= 1
	print()

def main():
	t = 1
	t = int(input())
	for _ in range(t):
		solve()

def gcd(a, b):
	while b:
		(a, b) = (b, a % b)
	return a

def input():
	return sys.stdin.readline().rstrip('\n').strip()

def print(*args, sep=' ', end='\n'):
	first = True
	for arg in args:
		if not first:
			sys.stdout.write(str(sep))
		sys.stdout.write(str(arg))
		first = False
	sys.stdout.write(end)

def vars():
	return map(int, input().split())

def array():
	return list(map(int, input().split()))
main()


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	ans = []
	for i in range(n):
		ans.append(2 * n + 2 * i)
	print(*ans)


t = int(input())
for i in range(t):
	n = int(input())
	p = 4 * n
	c = []
	k = 0
	for k in range(n, 0, -1):
		c.append(p - 2 * k)
	print(*c)


from math import *
t = int(input())
for u in range(t):
	n = int(input())
	x = 4 * n
	for i in range(n):
		print(x, end=' ')
		x = x - 2
	print()


from sys import stdin, stdout
import math
import heapq
import collections
input = stdin.readline

def inputnum():
	return int(input())

def inputnums():
	return map(int, input().split())

def inputlist():
	return list(map(int, input().split()))

def inputstring():
	return [x for x in input()]

def inputstrings():
	return [x for x in input().split()]

def inputstringnum():
	return [ord(x) - ord('a') for x in input()]

def inputmatrixchar(rows):
	arr2d = [[j for j in input().strip()] for i in range(rows)]
	return arr2d

def inputmatrixint(rows):
	arr2d = []
	for _ in range(rows):
		arr2d.append([int(i) for i in input().split()])
	return arr2d
t = int(input())
for q in range(t):
	n = inputnum()
	for i in range(2 * n + 2, 4 * n + 1, 2):
		print(i, end=' ')
	print()


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import ceil, floor
from copy import *
from collections import deque, defaultdict
from collections import Counter as counter
from itertools import combinations
from itertools import permutations as permutate
from bisect import bisect_left as bl
from operator import *
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192
from sys import stderr

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
				continue
			stack.pop()
			if not stack:
				break
			to = stack[-1].send(to)
		return to
	return wrapped_func
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def fsep():
	return map(float, inp().split())

def nextline():
	out('\n')

def testcase(t):
	for p in range(t):
		solve()

def pow(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res
from functools import reduce

def factors(n):
	return set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0)))

def gcd(a, b):
	if a == b:
		return a
	while b > 0:
		(a, b) = (b, a % b)
	return a

def prefix_sum(ar):
	return list(accumulate(ar))

def suffix_sum(ar):
	return list(accumulate(ar[::-1]))[::-1]

def N():
	return int(inp())
dx = [0, 0, 1, -1]
dy = [1, -1, 0, 0]

def YES():
	print('YES')

def NO():
	print('NO')

def Yes():
	print('Yes')

def No():
	print('No')
from collections import defaultdict

def numberOfSetBits(i):
	i = i - (i >> 1 & 1431655765)
	i = (i & 858993459) + (i >> 2 & 858993459)
	return ((i + (i >> 4) & 252645135) * 16843009 & 4294967295) >> 24

class MergeFind:

	def __init__(self, n):
		self.parent = list(range(n))
		self.size = [1] * n
		self.num_sets = n

	def find(self, a):
		to_update = []
		while a != self.parent[a]:
			to_update.append(a)
			a = self.parent[a]
		for b in to_update:
			self.parent[b] = a
		return self.parent[a]

	def merge(self, a, b):
		a = self.find(a)
		b = self.find(b)
		if a == b:
			return
		self.num_sets -= 1
		self.parent[a] = b
		self.size[b] += self.size[a]

	def set_size(self, a):
		return self.size[self.find(a)]

	def __len__(self):
		return self.num_sets

def primesbelow(N):
	correction = N % 6 > 1
	N = {0: N, 1: N - 1, 2: N + 4, 3: N + 3, 4: N + 2, 5: N + 1}[N % 6]
	sieve = [True] * (N // 3)
	sieve[0] = False
	for i in range(int(N ** 0.5) // 3 + 1):
		if sieve[i]:
			k = 3 * i + 1 | 1
			sieve[k * k // 3::2 * k] = [False] * ((N // 6 - k * k // 6 - 1) // k + 1)
			sieve[(k * k + 4 * k - 2 * k * (i % 2)) // 3::2 * k] = [False] * ((N // 6 - (k * k + 4 * k - 2 * k * (i % 2)) // 6 - 1) // k + 1)
	return [2, 3] + [3 * i + 1 | 1 for i in range(1, N // 3 - correction) if sieve[i]]
p = primesbelow(5000)

def solve():
	n = N()
	for i in range(4 * n, 2 * n, -2):
		print(i, end=' ')
	print()
testcase(int(inp()))


for _ in range(int(input())):
	n = int(input())
	for i in range(4 * n, 1, -2):
		if n == 0:
			break
		elif n == 1:
			print(i)
		else:
			print(i, end=' ')
		n -= 1


for _ in range(int(input())):
	n = int(input())
	if n == 1:
		print(2)
		continue
	c = 0
	for i in range(4 * n, 3, -2):
		c += 1
		print(i, end=' ')
		if c == n:
			break
	print()


a = int(input())
x = []
s = []
for i in range(a):
	z = int(input())
	x.append(z)
for i in x:
	for j in range(i):
		s.append(4 * i - 2 * (j + 1))
	s.sort()
	for j in range(i):
		print(s[j], end=' ')
	s.clear()
	print('')


def solve():
	n = int(input())
	z = []
	k = 4 * n
	for i in range(n):
		z.append(k)
		k -= 2
	return ' '.join(map(str, z))
t = int(input())
i = 0
while i < t:
	print(solve())
	i += 1


def solve(n):
	ans = [2 * n]
	for i in range(n - 1):
		ans.append(ans[-1] + 2)
	return ans
t = int(input())
for i in range(t):
	n = int(input())
	print(*solve(n))


for _ in range(int(input())):
	n = int(input())
	l = []
	for i in range(n):
		l.append(n * 4 - 2 * i)
	print(*l)


import itertools
import math
import sys
import os
from collections import defaultdict

def is_debug():
	return 'PYPY3_HOME' not in os.environ

def stdin_wrapper():
	data = '3\n2\n3\n10\n\n\n'
	for line in data.split('\n'):
		yield line
if not is_debug():

	def stdin_wrapper():
		while True:
			yield sys.stdin.readline()
inputs = stdin_wrapper()

def input_wrapper():
	return next(inputs)

def get_str():
	if is_debug():
		return input_wrapper()
	return input()

def get(_type):
	if _type == str:
		return get_str()
	return _type(input_wrapper())

def get_arr(_type):
	return [_type(x) for x in input_wrapper().split()]

def tuplerize(method):

	def wrap(*args, **kwargs):
		res = method(*args, **kwargs)
		if not isinstance(res, (tuple, list)):
			res = (res,)
		return res
	return wrap

@tuplerize
def solve(n):

	def is_prime(num):
		if num == 1 or num == 2:
			return True
		div = 2
		while True:
			if num % div == 0:
				return False
			if div * div > num:
				break
			div += 1
		return True
	res = []
	init = n * 4
	return [2 * x for x in range(n, 2 * n)]
t = get(int)
for _ in range(t):
	n = get(int)
	print(*solve(n))


T = int(input())
for t in range(T):
	N = int(input())
	rep = []
	rep.append(4 * N)
	for i in range(4 * N, 1, -1):
		if i % 2 == 0:
			good = True
			for alrep in rep:
				if i % alrep == 0 or alrep % i == 0:
					good = False
					continue
			if good:
				rep.append(i)
				if len(rep) == N:
					break
	ans = ''
	for val in rep:
		ans += str(val) + ' '
	print(ans)


import sys
import math

def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
t = II()
for q in range(t):
	n = II()
	b = n * 4
	a = [b - i * 2 for i in range(n)]
	print(*a)


t = int(input())
for q in range(t):
	n = int(input())
	for i in range(n, 2 * n):
		print(i * 2, end=' ')
	print()


def get_seats(n):
	return ' '.join((str(i) for i in range(2 * n, n * 4, 2)))
t = int(input())
for i in range(t):
	print(get_seats(int(input())))


t = int(input())
i = 0
while i < t:
	c = int(input())
	if c == 1:
		print(1)
	elif c == 2:
		print(6, 4)
	elif c == 3:
		print(4, 6, 10)
	else:
		A = []
		C = c * 2
		for j in range(c):
			A.append(C)
			C += 2
		print(*A)
	i += 1


t = int(input())
for _ in range(t):
	n = int(input())
	x = n * 4
	for i in range(n):
		print(x, end=' ')
		x = x - 2
	print()


t = int(input())
for _ in range(t):
	x = int(input())
	d = 4 * x
	while x > 0:
		x -= 1
		print(d, end=' ')
		d -= 2
	print('')


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline()

def RL():
	return map(int, sys.stdin.readline().split())

def RLL():
	return list(map(int, sys.stdin.readline().split()))

def N():
	return int(input())

def print_list(l):
	print(' '.join(map(str, l)))
for _ in range(N()):
	n = N()
	print_list([2 * i for i in range(2 * n, n, -1)])


import sys, os, io
I = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
for tc in range(1, 1 + int(I())):
	n = int(I())
	print(*list(range(4 * n, 1, -2))[:n])


n = int(input())
cb = []
for k in range(0, n):
	cb.append(int(input()))
for i in range(0, n):
	cf = 4 * cb[i]
	for j in range(0, cb[i]):
		if j == cb[i] - 1:
			print(f'{cf - 2}')
		else:
			print(f'{cf - 2}', end=' ')
		cf = cf - 2


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	b = []
	c = 4 * n
	for i in range(n):
		b.append(c)
		c -= 2
	print(*b)


t = int(input())
for z in range(t):
	n = int(input())
	r = 4 * n + 2
	for i in range(n):
		r -= 2
		print(r)


t = int(input())
a = []
for i in range(t):
	a.append(int(input()))
for j in range(t):
	k = a[j]
	b = []
	for i in range(2, 200):
		if k != 0:
			if 2 * i not in b:
				b.append(2 * i)
				for e in range(len(b) - 1):
					if 2 * i % b[e] == 0:
						b[e] = 2 * (i + 1)
				k -= 1
		else:
			break
	print(*b)


import typing
import sys
import math
import collections
import bisect
import itertools
import heapq
import decimal
import copy
INF = 10 ** 20
MOD = 10 ** 9 + 7

def ni():
	return int(sys.stdin.buffer.readline())

def ns():
	return map(int, sys.stdin.buffer.readline().split())

def na():
	return list(map(int, sys.stdin.buffer.readline().split()))

def na1():
	return list(map(lambda x: int(x) - 1, sys.stdin.buffer.readline().split()))

def main():
	t = ni()
	for _ in range(t):
		n = ni()
		base = 2 * n
		res = []
		for i in range(n):
			res.append(base + i * 2)
		print(*res, sep=' ')
main()


for _ in range(int(input())):
	n = int(input())
	ans = 2 * n
	for i in range(n):
		ans += 2
		print(ans, end=' ')
	print('')


for _ in range(int(input())):
	n = int(input())
	x = 4 * n
	c = 0
	i = 2 * n
	while c != n:
		print(i, end=' ')
		i = i + 2
		c = c + 1
	print('')


try:
	t = int(input())
	for i in range(t):
		a = int(input())
		ans = [i for i in range(1, 4 * a + 1) if i % 2 == 0][::-1]
		ans = ans[:a]
		print(*ans)
except:
	pass


for _ in [0] * int(input()):
	n = int(input())
	print(*range(2 * n + 2, 4 * n + 1, 2))


for _ in range(int(input())):
	n = int(input())
	a = n * 4
	output = []
	for i in range(n):
		output.append(a)
		a -= 2
	print(*output)


for _ in range(int(input())):
	n = int(input())
	ans = [2 * (n + i + 1) for i in range(n)]
	print(' '.join(map(str, ans)))


t = int(input())
for _ in range(t):
	n = int(input())
	if n == 1:
		print(2)
		continue
	x = n * 4
	count = 0
	while count < n:
		print(x, end=' ')
		count += 1
		x -= 2
	print()


import math

def solve(n):
	ans = []
	for i in range(4 * n - 2, -1, -2):
		if len(ans) < n:
			ans.append(i)
	return ans
t = int(input())
while t:
	n = int(input())
	print(*solve(n))
	t -= 1


for _ in range(int(input())):
	n = int(input())
	i = 4 * n
	ans = 0
	while i > 2:
		ans += 1
		print(i, end=' ')
		if ans == n:
			break
		i -= 2
	print()


import sys, os, io

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s + '\n')

def wi(n):
	sys.stdout.write(str(n) + '\n')

def wia(a):
	sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
import math, datetime, functools, itertools, operator, bisect, fractions, statistics
from collections import deque, defaultdict, OrderedDict, Counter
from fractions import Fraction
from decimal import Decimal
from sys import stdout
from heapq import heappush, heappop, heapify, _heapify_max, _heappop_max

def primeFactors(n):
	pf = []
	while n % 2 == 0:
		pf.append(2)
		n = n / 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			pf.append(int(i))
			n = n / i
	if n > 2:
		pf.append(int(n))
	return pf

def main():
	mod = 1000000007
	starttime = datetime.datetime.now()
	if os.path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	z = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919]
	tc = ri()
	for _ in range(tc):
		n = ri()
		a = []
		c = 0
		for i in range(4 * n, -1, -2):
			c += 1
			a.append(i)
			if c == n:
				break
		print(*a)
	endtime = datetime.datetime.now()
	time = (endtime - starttime).total_seconds() * 1000
	if os.path.exists('input.txt'):
		print('Time:', time, 'ms')

class FastReader(io.IOBase):
	newlines = 0

	def __init__(self, fd, chunk_size=1024 * 8):
		self._fd = fd
		self._chunk_size = chunk_size
		self.buffer = io.BytesIO()

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self, size=-1):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size if size == -1 else size))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

class FastWriter(io.IOBase):

	def __init__(self, fd):
		self._fd = fd
		self.buffer = io.BytesIO()
		self.write = self.buffer.write

	def flush(self):
		os.write(self._fd, self.buffer.getvalue())
		(self.buffer.truncate(0), self.buffer.seek(0))

class FastStdin(io.IOBase):

	def __init__(self, fd=0):
		self.buffer = FastReader(fd)
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

class FastStdout(io.IOBase):

	def __init__(self, fd=1):
		self.buffer = FastWriter(fd)
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.flush = self.buffer.flush
sys.stdin = FastStdin()
sys.stdout = FastStdout()
main()


def arrange(n):
	out = []
	for i in range(n):
		out.append(2 * (n + i))
	return out

def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		print(*arrange(n))
main()


t = int(input())
p = []
for _ in range(t):
	n = int(input())
	rs = []
	for i in range(n, n + n):
		rs.append(i * 2)
	p.append(rs)
for i in p:
	for j in i:
		print(j, end=' ')
	print()


t = int(input())
for case in range(t):
	n = int(input())
	arr = [2 * n + 2 * i for i in range(n)]
	print(str(arr)[1:-1].replace(',', ''))


for _ in range(int(input())):
	n = int(input())
	print(*range(4 * n, 4 * n - 2 * n, -2))


def seating(n):
	return [4 * n - 2 * i for i in range(1, n + 1)]
for _ in range(int(input())):
	n = int(input())
	print(' '.join(map(str, seating(n))))


import math
for _ in range(int(input())):
	n = int(input())
	ar = [4 * n]
	for i in range(4 * n - 1, 1, -1):
		flag = 0
		for j in ar:
			if i % j != 0 and j % i != 0 and (math.gcd(i, j) != 1):
				do = 1
			else:
				flag = 1
		if flag == 0:
			ar.append(i)
		if len(ar) == n:
			break
	for i in ar:
		print(i, end=' ')
	print()


import sys, time
from os import path
from collections import *
from heapq import *
from math import *

def solve(kkkk):
	(n, m, k, q, u, v, temp, ans) = [0, 0, 0, 0, 0, 0, 0, 0]
	n = inp()
	arr = []
	for i in range(n):
		arr.append(2 * n + 2 * i)
	outa(arr)

def main():
	t = 1
	t = inp()
	for i in range(t):
		solve(i + 1)
localsys = 0
start_time = time.time()
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
	localsys = 1
cin = sys.stdin.readline
cout = sys.stdout.write

def inp():
	return int(cin().strip())

def ins():
	return list(cin().strip())

def inm():
	return map(int, cin().strip().split())

def ina():
	return list(map(int, cin().strip().split()))

def out(a):
	cout(str(a) + '\n')

def outa(a):
	cout(' '.join(map(str, a)) + '\n')

def outm(a, b, c=None, d=None):
	cout(str(a) + ' ' + str(b))
	if c != None:
		cout(' ' + str(c))
	if d != None:
		cout(' ' + str(d))
	cout('\n')
main()
if localsys:
	print('\n\nTime Elapsed :', time.time() - start_time, 'seconds')


def kidsSeat(n):
	ans = []
	for i in range(3, int(4 * n) + 1):
		flag = 0
		if i % 2 == 0:
			for j in ans:
				if j % i == 0 or i % j == 0:
					ans.remove(j)
			ans.append(i)
		if len(ans) == n:
			return ans
n = int(input())
res = []
for i in range(n):
	p = int(input())
	res.append(kidsSeat(p))
for j in res:
	print(*j)


import sys
ii = lambda : sys.stdin.readline().strip()
idata = lambda : [int(qw) for qw in ii().split()]

def solve():
	n = int(ii())
	for i in range(2 * n, 4 * n, 2):
		print(i, end=' ')
	print()
	return
for _t in range(int(ii())):
	solve()


for i in range(int(input())):
	n = int(input())
	if n % 2 == 0:
		s = n + 1
		print(2 * s, end=' ')
		for i in range(n - 1):
			s += 1
			print(2 * s, end=' ')
	else:
		print(2 * n, end=' ')
		for i in range(n - 1):
			n += 1
			print(2 * n, end=' ')
	print()


for _ in range(int(input())):
	l = int(input())
	r = [4 * l]
	for x in range(l - 1):
		r.append(4 * l - 2 * (x + 1))
	print(*r)


import math
test_cases = int(input())
for test_case in range(test_cases):
	n = int(input())
	ans = []
	for k in range(1, 4 * n):
		ans = [k]
		for i in range(k + 1, 4 * n):
			count = 0
			for j in ans:
				if math.gcd(i, j) == 1:
					break
				if i % j == 0:
					break
				count += 1
			if count == len(ans):
				ans.append(i)
			if len(ans) == n:
				break
		if len(ans) == n:
			break
	print(*ans)


import sys

def multiple_input():
	return map(int, sys.stdin.readline().strip().split())

def list_input():
	return list(map(int, sys.stdin.readline().strip().split()))
for _ in range(int(input())):
	n = int(input())
	a = []
	for i in range(2 * n, 4 * n, 2):
		a.append(i)
	print(*a)


t = int(input())
for _ in range(t):
	n = int(input())
	q = 4 * n
	while n > 0:
		print(q, end=' ')
		n -= 1
		q -= 2
	print()


import math

def solution(n):
	exp = math.ceil(math.log(n, 2))
	for i in range(2 ** exp, 2 ** exp + n):
		if 2 * i <= 4 * n:
			print(2 * i, end=' ')
		else:
			print(2 ** exp * 2 - (2 * i - 4 * n), end=' ')
	print()
	return
t = int(input())
for tt in range(t):
	n = int(input())
	solution(n)


t = int(input())
for i in range(t):
	totalN = int(input())
	co = 2 * totalN
	for i in range(totalN):
		print(co, end=' ')
		co += 2
	print()


t = int(input())
for i in range(t):
	n = int(input())
	ls = []
	for j in range(4 * n, 2 * n + 1, -2):
		ls.append(j)
	print(*ls)


try:
	t = int(input())
	for i in range(t):
		n = int(input())
		limit = n * 4
		for i in range(limit, limit // 2, -2):
			print(i, end=' ')
		print()
except:
	pass


from sys import stdin

def si():
	return stdin.readline().strip()

def ii():
	return int(si())

def mi():
	return map(int, si().split())

def li():
	return list(mi())
t = ii()
for _ in range(t):
	n = ii()
	for i in range(4 * n, 2 * n, -2):
		print(i, end=' ')
	print()


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	a = []
	for i in range(4 * n, 2 * n + 1, -2):
		a.append(i)
	for i in a[:-1]:
		print(i, end=' ')
	print(a[-1])


t = int(input())
for ti in range(t):
	n = int(input())
	ans = ''
	for i in range(4 * n, 2 * n, -2):
		ans += str(i) + ' '
	print(ans)


t = int(input())
outputs = [''] * t
ns = [0] * t
m = 0
for i in range(t):
	ns[i] = int(input())
	m = max(ns[i], m)
A = [True] * (4 * m + 1)
A[0] = A[1] = False
for k in range(2, len(A)):
	if A[k]:
		for d in range(k * k, len(A), k):
			A[d] = False
n = 0
k = 0
for i in ns:
	k = i * 4
	while n < i:
		if not A[k] and k % 2 == 0:
			print(k, end=' ')
			n += 1
		k -= 1
	else:
		n = 0
		print(end='\n')


import sys
t = int(input().strip())
for case in range(t):
	n = int(input())
	for i in range(n):
		sys.stdout.write(str(4 * n - 2 * i))
		sys.stdout.write(' ')
	sys.stdout.write('\n')


for i in range(int(input())):
	n = int(input())
	for i in range(2 * n, 4 * n, 2):
		print(i, end=' ')
	print()


T = int(input())
for _ in range(T):
	N = int(input())
	ans = []
	i = 0
	while i != N:
		ans.append(4 * N - i * 2)
		i += 1
	print(*ans)


for t in range(int(input())):
	n = int(input())
	count = 0
	arr = [i for i in range(4 * n, 2 * n, -2)]
	print(*arr, end=' ')
	print()


import os
import sys
from io import BytesIO, IOBase
arr = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397]
from collections import defaultdict
from math import sqrt
import math

def solution():
	n = int(input())
	for i in range(n, 2 * n):
		print(i * 2, end=' ')
	print()

def main():
	testcases = 1
	testcases = int(input())
	for _ in range(testcases):
		solution()
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


for _ in range(int(input())):
	n = int(input())
	sp = list(range(4 * n - 2, 1, -2))
	print(*sp[:n])


def check(a):
	if a == 1:
		return 0
	k = 2
	while k * k <= a:
		if a % k == 0:
			return 0
		k += 1
	return 1
for _ in range(int(input())):
	n = int(input())
	for i in range(2 * n, 4 * n, 2):
		print(i, end=' ')
	print()


I = lambda : int(input())
for i in range(I()):
	n = I()
	print(*range(2 * n + 2, 4 * n + 2, 2))


import sys
number_of_tests = int(sys.stdin.readline().strip())
for test_case in range(number_of_tests):
	n = int(sys.stdin.readline().strip())
	seat_count = 0
	first_seat = 4 * n
	while seat_count < n:
		print(first_seat, end=' ')
		seat_count += 1
		first_seat -= 2
	print()


for i in range(0, int(input())):
	n = int(input())
	k = 4 * n
	p = 0
	for j in range(4 * n, 0, -1):
		if p == n - 1:
			break
		print(k, end=' ')
		k = k - 2
		p += 1
	print(k, end='\n')


import math
from collections import Counter
try:
	for _ in range(int(input())):
		n = int(input())
		n *= 2
		for i in range(n, 2 * n, 2):
			print(i, end=' ')
		print()
except EOFError as e:
	print(e)


import math
for t in range(int(input())):
	n = int(input())
	if n == 1:
		print(4)
		continue
	c = 0
	x = n // 2 * 4
	l = [x]
	for i in range(l[len(l) - 1] + 1, 4 * n + 1):
		f = 0
		for j in range(len(l)):
			if i % l[j] == 0 or math.gcd(i, l[j]) == 1:
				f = 1
				break
		if f == 0:
			l.append(i)
	for i in range(len(l)):
		if i < n:
			print(l[i], end=' ')
	print('')


import sys
import math
import collections
input = sys.stdin.readline
t = int(input())
for w in range(t):
	n = int(input())
	l = []
	c = 0
	i = 4 * n
	while c < n:
		l.append(i)
		c += 1
		i -= 2
	print(*l)


t = int(input())
for i in range(t):
	n = int(input())
	k = 0
	x = n * 4
	a = []
	while k < n:
		x = x - 2
		arg = False
		for j in range(len(a)):
			if x % a[j] == 0:
				arg = True
				break
		if not arg:
			a.append(x)
			k += 1
	print(*a)


t = int(input())
cases = []
for i in range(t):
	cases.append(int(input()))
for i in range(t):
	output = []
	for j in range(cases[i] * 4 - 2, cases[i] * 2 - 1, -2):
		output.append(j)
	for j in range(len(output)):
		print(output[j], end=' ')
	print('')
	output = []


for test in range(int(input())):
	n = int(input())
	m = 2 * n
	chairs = []
	for i in range(n):
		chairs.append(m)
		m += 2
	print(*chairs)


t = int(input())
while t:
	x = int(input())
	s = 0
	copy = x
	while x != 0:
		ans = 4 * copy
		ans -= s
		s += 2
		x -= 1
		print(ans, end=' ')
	print()
	t -= 1


t = int(input())
for _ in range(t):
	a = []
	n = int(input())
	k = 4 * n - 1
	for i in range(k, 1, -1):
		if len(a) == n:
			break
		if i % 2 == 0:
			a.append(i)
	for i in a:
		print(i, sep=' ', end=' ')
	print()


for _ in range(int(input())):
	n = int(input())
	now = 4 * n - 2
	while n > 0:
		print(now, end=' ')
		now -= 2
		n -= 1
	print()


import math
for _ in range(int(input())):
	n = int(input())
	for i in range(n):
		print(2 * n + i * 2, end=' ')
	print()


import sys
import math as m

def mod(a, b):
	if a % b == 0:
		return b
	return mod(b, a % b)
t = int(input())
while t:
	t -= 1
	n = int(input())
	for i in range(n):
		if i == n - 1:
			print(n * 4 - i * 2)
		else:
			print(n * 4 - 2 * i, end=' ')


from sys import stdin

def main():
	input = lambda : stdin.readline()[:-1]
	T = int(input())
	for _ in [0] * T:
		N = int(input())
		chair = 4 * N
		ans = []
		for _ in range(N):
			ans.append(chair)
			chair -= 2
		print(*ans)
main()


def solution(n):
	for t in range(4 * n, 4 * n - 2 * n, -2):
		print(t, sep=' ', end=' ')
	print()
n = int(input())
for _ in range(n):
	a = int(input())
	solution(a)


for t in range(int(input())):
	w = int(input())
	n = w
	for i in range(2 * n, 4 * n, 2):
		if n == 0:
			break
		print(i)
		n -= 1


import math

def solve(n):
	counter = 0
	for i in range(4 * n):
		print(4 * n - 2 * i, end='')
		counter += 1
		if counter == n:
			print()
			return
		else:
			print(' ', end='')
t = int(input())
for i in range(t):
	n = int(input())
	solve(n)


t = int(input())
for _ in range(t):
	n = int(input())
	m = 4 * n
	l = list()
	while m != 2 * n:
		l.append(m)
		m -= 2
	print(*l)


n = int(input())
for i in range(n):
	f = int(input())
	l = []
	for j in range(f):
		l.append(2 * f + 2 * j)
	print(*l)


for _ in range(int(input())):
	n = int(input())
	c = 1
	out = []
	if n != 1:
		l = list(range(4, 4 * n + 1, 2))
		l.sort(reverse=True)
		i = 0
		while i < n:
			print(l[i], end=' ')
			i += 1
		print()
	else:
		print(2)


t = int(input())
for z in range(t):
	n = int(input())
	d = {}
	for i in range(4 * n, 1, -2):
		f = 0
		for x in d:
			if x % i == 0:
				f = 1
				break
		if f == 0:
			d[i] = 1
	for x in d:
		print(x, end=' ')
	print()


import os
from sys import stdin, stdout

def solve(tc):
	n = int(stdin.readline().strip())
	ans = [4 * n]
	for i in range(n - 1):
		ans.append(ans[-1] - 2)
	print(*ans)
tcs = 1
tcs = int(stdin.readline().strip())
tc = 1
while tc <= tcs:
	solve(tc)
	tc += 1


for i in range(int(input())):
	n = int(input())
	x = []
	for i in range(4 * n):
		if i % 2 == 0:
			x.append(i)
	p = x[n:2 * n + 1]
	for i in p:
		print(i, end=' ')


T = int(input())
for _ in range(0, T):
	n = int(input())
	tt = 2 * n
	L = []
	for i in range(n):
		L.append(tt)
		tt += 2
	print(*L)


def main():
	n = int(input())
	for i in range(n):
		print(2 * (n + i + 1), end=' ')
	print()
for _ in range(int(input())):
	main()


import sys
import math
import collections

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_string():
	return sys.stdin.readline().strip()
for t in range(int(input())):
	n = int(input())
	sol = [4 * n - 2]
	for i in range(4 * n, 1, -1):
		no = i
		poss = 0
		for j in range(len(sol)):
			val = sol[j]
			if val % no == 0 or no % val == 0 or math.gcd(val, no) == 1:
				poss += 1
				break
		if poss == 0:
			sol.append(i)
	print(*sol)


def program():
	n = int(input())
	m = 4 * n
	for i in range(n):
		print(m, end=' ')
		m -= 2
	print()
number_of_testcases = int(input())
for i in range(number_of_testcases):
	program()


import sys
from copy import *
from bisect import *
from math import gcd, ceil, sqrt
from itertools import permutations as prm, product

def eprint(*args):
	print(*args, file=sys.stderr)
zz = 1
if zz:
	input = sys.stdin.readline
else:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('all.txt', 'w')
di = [[-1, 0], [1, 0], [0, 1], [0, -1]]

def string(s):
	return ''.join(s)

def fori(n):
	return [fi() for i in range(n)]

def inc(d, c, x=1):
	d[c] = d[c] + x if c in d else x

def bo(i):
	return ord(i) - ord('A')

def li():
	return [int(xx) for xx in input().split()]

def fli():
	return [float(x) for x in input().split()]

def comp(a, b):
	if a > b:
		return 2
	return 2 if a == b else 0

def gi():
	return [xx for xx in input().split()]

def cil(n, m):
	return n // m + int(n % m > 0)

def fi():
	return int(input())

def pro(a):
	return reduce(lambda a, b: a * b, a)

def swap(a, i, j):
	(a[i], a[j]) = (a[j], a[i])

def si():
	return list(input().rstrip())

def mi():
	return map(int, input().split())

def gh():
	sys.stdout.flush()

def isvalid(i, j, n, m):
	return 0 <= i < n and 0 <= j < m

def bo(i):
	return ord(i) - ord('a')

def graph(n, m):
	for i in range(m):
		(x, y) = mi()
		a[x].append(y)
		a[y].append(x)
t = fi()
while t > 0:
	t -= 1
	n = fi()
	d = []
	for i in range(2, 4 * n + 1, 2):
		d.append(i)
	d = d[::-1]
	print(*d[:n])


for t in range(int(input())):
	n = int(input())
	a = 2 * n
	A = []
	for i in range(n):
		a = a + 2
		A.append(a)
	print(*A)


for i in range(int(input())):
	n = int(input())
	l = []
	a = 4 * n
	for j in range(n):
		l.append(a)
		a -= 2
	print(*l)


t = int(input())
for j in range(t):
	n = int(input())
	s = []
	cnt = 0
	for j in range(4 * n, 0, -2):
		s.append(j)
	print(*s[:n])


for i in range(int(input())):
	n = int(input())
	arr = [i for i in range(2 * n, 4 * n, 2)]
	print(*arr)


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 18
MOD = 10 ** 9 + 7
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
for _ in range(int(ri())):
	n = int(ri())
	ans = []
	for i in range(4 * n, 2 * n, -2):
		ans.append(i)
	print(*ans)


t = int(input())
for _ in range(t):
	n = int(input())
	if n == 2:
		print(4, 6)
	else:
		i = n * 4
		x = n
		while i >= 0 and x > 0:
			print(i, end=' ')
			i -= 2
			x -= 1
		print()


t = int(input())
for yy in range(t):
	n = int(input())
	num = 4 * n
	for i in range(n):
		print(num, end=' ')
		num -= 2
	print()


for t in range(int(input())):
	n = int(input())
	x = []
	k = 0
	for i in range(4 * n, 1, -2):
		x.append(i)
		if len(x) == n:
			break
	print(*x)


from sys import stdin, stdout
import math, sys, heapq
from itertools import permutations, combinations
from collections import defaultdict, deque, OrderedDict
from os import path
import random
import bisect as bi

def yes():
	print('YES')

def no():
	print('NO')
if path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

	def I():
		return int(input())

	def In():
		return map(int, input().split())
else:

	def I():
		return int(stdin.readline())

	def In():
		return map(int, stdin.readline().split())

def dict(a):
	d = {}
	for x in a:
		if d.get(x, -1) != -1:
			d[x] += 1
		else:
			d[x] = 1
	return d

def find_gt(a, x):
	i = bi.bisect_left(a, x)
	if i != len(a):
		return i
	else:
		return -1

def main():
	try:
		n = I()
		dp = [0 for x in range(4 * n + 1)]
		for i in range(4 * n, 3, 2):
			t = i
			q = 2
			t //= q
			while t >= 4:
				dp[t] = 1
				t //= q
		ans = []
		for i in range(4, 4 * n + 1, 2):
			if dp[i] == 0:
				ans.append(i)
		ans.reverse()
		for i in range(min(len(ans), n)):
			print(ans[i], end=' ')
		print()
	except:
		pass
M = 998244353
P = 1000000007
for _ in range(I()):
	main()


for _ in range(int(input())):
	m = int(input())
	for i in range(m):
		print(4 * m - 2 * i, end=' ')
	print()


t = int(input())
for _ in range(t):
	n = int(input())
	print(' '.join(map(str, [4 * n - 2 * i for i in range(n)])))


from sys import stdin, stdout
from os import path
if path.exists('input.txt'):
	stdin = open('input.txt', 'r')

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)
for _ in range(int(stdin.readline())):
	x = int(stdin.readline())
	for j in range(4, x * 4 + 2):
		out = []
		for i in range(j, x * 4 + 2):
			flag = True
			if len(out) == x:
				break
			for item in out:
				if gcd(i, item) == 1 or (i % item == 0 or item % i == 0):
					flag = False
					break
			if flag == True:
				out.append(i)
		if len(out) == x:
			break
	print(*out)


for i in range(int(input())):
	a = int(input())
	b = 4 * a
	l = [b]
	for j in range(b, 3, -2):
		k = l.copy()
		m = l.copy()
		k[:] = map(lambda x: x % j, k)
		m[:] = map(lambda x: j % x, m)
		if k.count(0) == 0 and m.count(0) == 0:
			l.append(j)
		if len(l) == a:
			break
	print(*l)


def solve():
	n = int(input())
	childs = list()
	start = 4 * n - 2
	for child in range(n):
		for pos in range(start, 1, -1):
			position = -1
			for child_pos in childs:
				if child_pos % pos != 0:
					position = pos
					break
			if position != -1:
				childs.append(position)
				start = position - 2
				break
		else:
			childs.append(start)
			start -= 2
	print(*childs)

def main():
	for _ in range(int(input())):
		solve()
main()


from math import *
from operator import *
t = int(input())
for _ in range(t):
	n = int(input())
	k = n * 4
	l = list()
	for i in range(n):
		l.append(k)
		k -= 2
	print(*l)


rn = lambda : int(input())
rl = lambda : list(map(int, input().split()))
rns = lambda : map(int, input().split())
rs = lambda : input()
yn = lambda x: print('Yes') if x else print('No')
YN = lambda x: print('YES') if x else print('NO')
for _ in range(rn()):
	n = rn()
	l = list(range(4 * n, 2 * n, -2))
	print(*l)


for _ in range(int(input())):
	n = int(input())
	count = 0
	for i in range(4 * n, 0, -2):
		print(i - 2, end=' ')
		count += 1
		if count == n:
			break
	print('')


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	seen = set()
	vals = []
	for i in range(4 * n - 2, 1, -2):
		x = 2
		can = True
		while i * x <= 4 * n:
			if i * x in seen:
				can = False
				break
			x += 1
		if can:
			seen.add(i)
			vals.append(i)
	for x in vals:
		if x != vals[-1]:
			print(x, end=' ')
		else:
			print(x)


def testcases(b):
	lst = []
	i = 0
	while i < b:
		c = 4 * b - 2 - 2 * i
		i += 1
		lst.append(c)
		x = ' '.join((str(i) for i in lst))
	return x
a = int(input())
for i in range(1, a + 1):
	b = int(input())
	print(testcases(b))


for _ in range(int(input())):
	n = int(input())
	print(*[e for e in range(2 * n, 2 * n + (n - 1) * 2 + 1, 2)])


from math import gcd
for _ in range(int(input())):
	n = int(input())
	ans = list()
	for i in range(4 * n, 0, -1):
		for j in ans:
			if i % j == 0 or j % i == 0 or gcd(i, j) == 1:
				break
		else:
			ans.append(i)
	print(*ans)


import math
from collections import defaultdict as dft, deque, Counter
from heapq import heappush, heappop

def mp():
	return map(int, input().split())

def ml():
	return list(map(int, input().split()))
mxn = 1000
arr = [1] * mxn
pri = []
for i in range(2, mxn):
	if arr[i]:
		pri.append(i)
		j = 2
		while i * j < mxn:
			arr[i * j] = 0
			j += 1

def solve():
	n = int(input())
	res = []
	count = 0
	k = 1
	while True:
		st = k
		count = 0
		res = []
		while count < n:
			if st > 4 * n:
				break
			chk = 1
			for num in res:
				if st % num == 0 or math.gcd(st, num) == 1:
					chk = 0
					break
			if chk:
				res.append(st)
				count += 1
			st += 1
		if len(res) == n:
			break
		k += 1
	print(*res)
tc = int(input())
for _ in range(tc):
	solve()


def solve(n, ans):
	arr = []
	for i in range(4 * n, 0, -2):
		arr.append(str(i))
		if len(arr) == n:
			break
	ans.append(arr)

def main():
	t = int(input())
	ans = []
	for i in range(t):
		n = int(input())
		solve(n, ans)
	for i in ans:
		print(' '.join(i))
main()


T = int(input())
L = []
for i in range(T):
	L.append(int(input()))
for n in L:
	for i in range(n):
		print(4 * n - 2 * i, end=' ')
	print()


def gcd(x, y):
	while y != 0:
		(x, y) = (y, x % y)
	return x

def oneLineArrayPrint(arr):
	print(' '.join([str(x) for x in arr]))
t = int(input())
for _ in range(t):
	n = int(input())
	ans = []
	for i in range(4 * n, 0, -2):
		if len(ans) == n:
			break
		ans.append(i)
	oneLineArrayPrint(ans)


t = int(input())
for _ in range(t):
	n = int(input())
	if n == 1:
		print(4)
	else:
		i = n
		temp = 4 * n
		while i:
			temp -= 2
			print(temp, end=' ')
			i -= 1
		print()


test = int(input())
while test:
	n = int(input())
	if n == 1:
		print(1)
	else:
		for i in range(n, 2 * n):
			print(2 * i, end=' ')
		print()
	test -= 1


def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s)])

def invr():
	return map(int, input().split())
n = inp()
for _ in range(n):
	x = inp()
	ans = ''
	for i in range(4 * x - 2, 2 * x - 2, -2):
		ans += str(i) + ' '
	print(ans)


T = int(input())
for _ in range(T):
	n = int(input())
	data = list()
	if n == 1:
		data.append(1)
	else:
		data.append(4 * n - 2)
		while len(data) < n:
			for i in range(4 * n - 4, 0, -2):
				possible = 1
				for div in data:
					if div % i == 0:
						possible = 0
						break
				if possible:
					data.append(i)
	print(*data)


for i in range(int(input())):
	num = int(input())
	num1 = num * 4 + 1
	data = [True for i in range(num1 + 1)]
	p = num * 2
	p1 = num * 2
	count = num
	while p <= num1:
		if p % 2 == 0:
			for i in range(p * 2, num1, p):
				if data[i]:
					data[i] = False
		elif data[p]:
			data[p] = False
		p += 1
	final = []
	for i in range(p1, num1):
		if data[i]:
			final.append(i)
	for i in range(0, num):
		print(final[i], end=' ')
	print()


import math
for _ in range(int(input())):
	n = int(input())
	a = []
	x = 4 * n + 1
	for i in range(x - 1, 4 - 1, -2):
		if len(a) >= n:
			break
		m = 0
		if len(a) == 0:
			a.append(i)
		for j in range(len(a)):
			if a[j] % i == 0 and i % a[j] == 0:
				m += 2
		if m == 0:
			a.append(i)
	for i in range(n):
		print(a[i], end=' ')
	print()


for T in range(int(input())):
	n = int(input())
	if n < 10:
		start = 4 * (n // 4 + 1)
	else:
		start = 6 * (n // 4 + 1)
	all = [start]
	for i in range(start, 4 * n + 1, 2):
		flag = True
		for j in all:
			if i % j == 0:
				flag = False
				break
		if flag:
			all.append(i)
	print(*all)


for _ in range(int(input())):
	n = int(input())
	l = []
	for i in range(4 * n - 2, 2, -2):
		l.append(i)
	if n == 1:
		print(n + 1)
	else:
		print(*l[:n])


t = int(input())
for i in range(t):
	n = int(input())
	lst1 = []
	for i in range(1, 4 * n + 1):
		lst1.append(2 * i)
	for i in range(n - 1, 2 * n - 1):
		print(lst1[i], end=' ')
	print()


from math import *
from bisect import *
from collections import *
from random import *
from decimal import *
import sys
input = sys.stdin.readline

def inp():
	return int(input())

def st():
	return input().rstrip('\n')

def lis():
	return list(map(int, input().split()))

def ma():
	return map(int, input().split())
t = inp()
while t:
	t -= 1
	n = inp()
	ha = []
	ii = 4 * n
	for i in range(n):
		print(ii, end=' ')
		ii -= 2
	print()


import sys
data = sys.stdin.read()
data = data.split()
t = int(data[0])
for i in range(1, int(t) + 1):
	n = int(data[i])
	answer = n * 4 - 2
	full_answer = []
	for l in range(n):
		full_answer.append(str(answer))
		answer -= 2
	print(' '.join(full_answer))


from sys import stdin, stdout
from collections import deque
import bisect
R = lambda : stdin.readline().strip()
RL = lambda f=None: list(map(f, R().split(' '))) if f else list(R().split(' '))
output = lambda x: stdout.write(str(x) + '\n')
output_list = lambda x: output(' '.join(map(str, x)))
T = int(input())
for _ in range(T):
	n = int(input())
	st = 2 * n
	ans = []
	for i in range(n):
		ans.append(st + 2 * i)
	print(*ans)


def read_generator():
	while True:
		tokens = input().split(' ')
		for t in tokens:
			yield t
reader = read_generator()

def readword():
	return next(reader)

def readint():
	return int(next(reader))

def readfloat():
	return float(next(reader))

def readline():
	return input()

def solve(n):
	res = [str(2 * n + i * 2) for i in range(n)]
	return ' '.join(res)
tests = readint()
for t in range(tests):
	n = readint()
	print(solve(n))


t = int(input())
for i in range(t):
	n = int(input())
	g = 2 * n - 2
	ans = [g]
	if n == 1:
		print(1)
		continue
	if n == 2:
		print(4, 6)
		continue
	for k in range(g + 2, 4 * n + 1, 2):
		f = 0
		if len(ans) >= n:
			break
		for j in ans:
			if k % j == 0:
				f = 1
				break
		if f == 0:
			ans.append(k)
		if len(ans) >= n:
			break
	print(*ans)


def main():
	n = int(input())
	for i in range(4 * n, 2 * n, -2):
		print(i, end=' ')
	print('')
rw = int(input())
for wewq in range(rw):
	main()


t = int(input())
for _ in range(t):
	n = int(input())
	s = n * 2
	while n > 0:
		print(s, end=' ')
		s += 2
		n -= 1


import sys

def find_chairs(num):
	result = []
	start = num * 2
	delta = 0
	for i in range(num):
		result.append(start + delta)
		delta += 2
	return result

def main():
	solutions = []
	sys.stdin.readline()
	for num in sys.stdin:
		solutions.append(find_chairs(int(num)))
	for solution in solutions:
		for n in solution:
			print(n, end=' ')
		print()
main()


t = int(input())
ll = []
for _ in range(t):
	ll.append(int(input()))
for l in ll:
	res = [str(i) for i in range(4 * l, 2 * l, -2)]
	print(' '.join(res))


t = int(input())
mas = []
mi = []
for i in range(t):
	n = int(input())
	mas.append(n)
	mi.append([mas[i] * 2])
for i in range(t):
	l = mas[i] * 2 + mas[i] * 2
	for j in range(mas[i] * 2, l, 2):
		mi[i].append(j)
for k in range(t):
	for j in range(1, mas[k] + 1):
		print(mi[k][j], '', end='')
	print()


try:
	t = int(input())
	for i in range(t):
		n = int(input())
		p = []
		limit = 4 * n
		first = limit - 2
		for i in range(first, 0, -2):
			flag = 'Blue'
			for j in range(len(p)):
				if p[j] % i == 0:
					flag = 'Red'
					break
			if flag == 'Blue':
				p.append(i)
		for i in p:
			print(i, end=' ')
		print('')
except:
	pass


for i in range(int(input())):
	n = int(input())
	l = []
	c = 0
	var = 4 * n
	while 1:
		if c == n:
			break
		l.append(var)
		var -= 2
		c += 1
	print(*l)


t = int(input())
for i in range(t):
	n = int(input())
	x = 4 * n
	c = 0
	for j in range(x, -2, -2):
		print(j)
		c += 1
		if c >= n:
			break


import os, sys
from collections import defaultdict, Counter, deque
from io import BytesIO, IOBase
from math import gcd

def lcm(a, b):
	return a * b // gcd(a, b)
import math as mt
MAXN = 100001
spf = [0 for i in range(MAXN)]

def getFactorization(x):
	ret = list()
	while x != 1:
		ret.append(spf[x])
		x = x // spf[x]
	return ret
import math

def smaa(a, b):
	x = 1
	for i in range(2, int(math.sqrt(b)) + 1, 2):
		if a % i == b % i == 0:
			x *= i
	return x

def main():
	for _ in range(int(input())):
		n = int(input())
		x = 0
		for i in range(4 * n, -1, -2):
			print(i, end=' ')
			x += 1
			if x == n:
				break
		print()
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


for _ in range(int(input())):
	n = int(input())
	c = 0
	l = 4 * n
	while True:
		if c == n:
			break
		print(l, end=' ')
		l -= 2
		c = c + 1
	print()


t = int(input())
for tt in range(t):
	n = int(input())
	if n == 1:
		print(4 * n)
	elif n == 2:
		print(6, 4)
	else:
		ans = []
		ans.append(4 * n - 2)
		i = 1
		while i < n:
			ans.append(ans[-1] - 2)
			i += 1
		print(*ans)


def isComposite(n):
	if n <= 1:
		return False
	if n <= 3:
		return False
	if n % 2 == 0 or n % 3 == 0:
		return True
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return True
		i = i + 6
	return False
for _ in range(int(input())):
	n = int(input())
	arr = []
	for i in range(4, 4 * n + 1):
		if isComposite(i):
			arr.append(i)
	result = list(filter(lambda x: x % 2 == 0, arr))
	for i in range(len(result) - 1, n - 2, -1):
		print(result[i], end=' ')
	print()


def mySolver(n):
	li = []
	for (i, j) in zip(range(4 * n, 0, -2), range(n)):
		if j != n:
			li.append(i)
		else:
			break
	return li

def main():
	case = int(input())
	myAns = []
	for i in range(0, case):
		n = int(input())
		myAns.append(mySolver(n))
	for j in myAns:
		print(*j, sep=' ')
main()


def main():
	t = int(input())
	outputs = []
	for __ in range(t):
		n = int(input())
		if n == 1:
			print(1)
		elif n % 2 == 0:
			print(' '.join([str(num) for num in range(n * 2, n * 2 + (n - 1) * 2 + 1, 2)]))
		else:
			x = []
			req = (n - 1) * 2
			x.append(str(req))
			recent = eval(x[-1])
			while len(x) < n:
				cur = recent + 2
				if cur % req != 0:
					x.append(str(cur))
				recent = cur
			print(' '.join(x))
	for output in outputs:
		print(output)
main()


t = int(input())
for i in range(t):
	n = int(input())
	contador = 2 * n
	for i in range(n - 1):
		print(contador, end=' ')
		contador += 2
	print(contador)


import math
for _ in range(int(input())):
	n = int(input())
	chek = 0
	for i in range(4 * n, -1, -2):
		print(i, end=' ')
		chek += 1
		if chek == n:
			break
	print()


n = int(input())
for i in range(0, n):
	o = int(input())
	A = o * 2
	for j in range(0, o):
		print(A, end=' ')
		A += 2
	print()


for _ in range(int(input())):
	n = int(input())
	j = 1
	ara = [4 * n]
	for i in range(4 * n - 2, 2, -2):
		ara.append(i)
		j += 1
		if j == n:
			break
	print(*ara, sep=' ')


loops = int(input())
output = []
for i in range(loops):
	lst = []
	n = int(input())
	for i in range(n):
		lst.append(4 * n - 2 * i)
	output.extend([lst])
for i in output:
	print(' '.join(map(str, i)))


class Input:

	def __init__(self, file):
		self.file = open(file)

	def read_line_as_list(self):
		return self.file.readline().split()

	def read_line_as_list_of_numbers(self):
		return list(map(int, self.file.readline().split()))

	def read_line_as_map_of_numbers(self):
		return map(int, self.file.readline().split())

	def read_line_as_number(self):
		return int(self.file.readline())

	def close(self):
		self.file.close()

class StandardInput:

	@staticmethod
	def read_line_as_list():
		return input().split()

	@staticmethod
	def read_line_as_list_of_numbers():
		return list(map(int, input().split()))

	@staticmethod
	def read_line_as_map_of_numbers():
		return map(int, input().split())

	@staticmethod
	def read_line_as_number():
		return int(input())

class Output:

	def __init__(self, file):
		self.file = open(file, 'w')
		self.lines = []

	def write_line(self, line):
		self.lines.append(line)

	def write_int_as_line(self, line):
		self.lines.append(str(line))

	def write_list_of_numbers_as_line(self, lst):
		self.lines.append(''.join([str(e) + ' ' for e in lst]))

	def close(self):
		for line in self.lines:
			self.file.write(line + '\n')
		self.file.close()

class StandardOutput:

	@staticmethod
	def write_line(line):
		print(line)

	@staticmethod
	def write_int_as_line(line):
		print(str(line))

	@staticmethod
	def write_list_of_numbers_as_line(lst):
		print(''.join([str(e) + ' ' for e in lst]))
for i in range(StandardInput.read_line_as_number()):
	n = StandardInput.read_line_as_number()
	StandardOutput.write_list_of_numbers_as_line([4 * n - 2 * e for e in range(n)])


t = int(input())
while t:
	t -= 1
	n = int(input())
	for i in range(n):
		print(str(2 * i + 2 * n), end=' ')


t = int(input())
for z in range(t):
	n = int(input())
	i = 0
	while i < n:
		print(4 * n - i * 2, end=' ')
		i += 1
	print()


import math
for _ in range(int(input())):
	n = int(input())
	for ii in range(3, 4 * n):
		ls = [ii + 1]
		for i in range(ls[0], 4 * n + 1):
			if len(ls) == n:
				break
			p = 1
			for j in ls:
				if i % j == 0 or math.gcd(i, j) == 1 or j % i == 0:
					p = 0
					break
			if p:
				ls.append(i)
		if len(ls) == n:
			print(''.join((str(a) + ' ' for a in ls)))
			break


from sys import stdin as stin, stdout as stout, setrecursionlimit as srl
from collections import defaultdict as dd, Counter, deque as dq

def get_ints():
	return map(int, stin.readline().split())

def get_list():
	return list(map(int, stin.readline().split()))

def get_int():
	return int(stin.readline())

def get_str():
	return stin.readline()
for _ in range(get_int()):
	n = get_int()
	if n == 1:
		print(4)
		continue
	ans = [0] * n
	if not n & 1:
		k = 2 * n
		for i in range(n):
			ans[i] = k
			k += 2
	else:
		k = 2 * n - 2
		for i in range(n - 1):
			ans[i] = k
			k += 2
		ans[-1] = k + 2
	print(*ans)


for i in range(int(input())):
	n = int(input())
	li = []
	for i in range(n):
		li.append(4 * n - 2 * i)
	print(*li)


t = int(input())
while t > 0:
	n = int(input())
	m = 1
	if n == 1:
		print(1)
	elif n == 2:
		print('4 6')
	else:
		print(4 * n - 2, end=' ')
		temp = 4 * n - 2
		for i in range(n - 1):
			if m == 1:
				print(temp - 4, end=' ')
				temp = temp - 4
				m = 0
			else:
				print(temp - 2, end=' ')
				temp -= 2
		print()
	t -= 1


t = int(input())
for x in range(t):
	n = int(input())
	s = ''
	for i in range(4 * n - 2, 2 * n - 1, -2):
		s += ' ' + str(i)
	print(s.strip())


t = int(input())
for i in range(t):
	n = int(input())
	j = 2 * n
	res = []
	while j < 4 * n:
		res.append(j)
		j += 2
	print(*res)


for i in range(int(input())):
	x = int(input())
	y = []
	z = 4 * x
	for i in range(x):
		y.append(z)
		z = z - 2
	print(*y)


for _ in range(int(input())):
	n = int(input())
	_max = n * 4
	ans = ''
	for i in range(n):
		ans += f'{_max - 2 * i} '
	print(ans)


t = int(input())
for i in range(t):
	n = int(input())
	cur = 4 * n
	while cur > 2 * n:
		print(cur, end=' ')
		cur -= 2


import sys
t = int(sys.stdin.readline())
for i in range(t):
	n = int(sys.stdin.readline())
	cnt1 = 4
	cnt2 = cnt1
	res = []
	res.append(cnt1)
	while True:
		b = True
		if max(res) > 4 * n:
			res = []
			cnt1 += 2
			cnt2 = cnt1
			res.append(cnt1)
			continue
		if len(res) >= n:
			break
		cnt2 += 2
		for j in res:
			if cnt2 % j == 0:
				b = False
				break
		if b:
			res.append(cnt2)
	print(*res)


import sys
t = int(input())
for test in range(t):
	n = int(input())
	res = []
	for i in range(n):
		res.append(str(4 * n - 2 * i))
	print(' '.join(res))


import sys
from math import *
from fractions import *

def main():

	def modst(a, s):
		ret = 1
		while s:
			if s % 2:
				ret = ret * a % mod
			a = a * a % mod
			s //= 2
		return ret

	def C_n_k(n, k):
		return fact[n] * modst(fact[n - k] * fact[k] % mod, mod - 2) % mod
	n = int(sys.stdin.readline().strip())
	print(*[4 * n - 2 * i for i in range(n)])
for i in range(int(sys.stdin.readline().strip())):
	main()


import math
t = int(input())
while t > 0:
	p = int(input())
	f = p
	p = 2 * p - 2
	for i in range(f):
		p += 2
		print(p, end=' ')
	print()
	t -= 1


import os, sys
from io import IOBase, BytesIO
py2 = round(0.5)
if py2:
	from future_builtins import ascii, filter, hex, map, oct, zip
	range = xrange
BUFSIZE = 8192

class FastIO(BytesIO):
	newlines = 0

	def __init__(self, file):
		self._file = file
		self._fd = file.fileno()
		self.writable = 'x' in file.mode or 'w' in file.mode
		self.write = super(FastIO, self).write if self.writable else None

	def _fill(self):
		s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
		self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
		return s

	def read(self):
		while self._fill():
			pass
		return super(FastIO, self).read()

	def readline(self):
		while self.newlines == 0:
			s = self._fill()
			self.newlines = s.count(b'\n') + (not s)
		self.newlines -= 1
		return super(FastIO, self).readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.getvalue())
			(self.truncate(0), self.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		if py2:
			self.write = self.buffer.write
			self.read = self.buffer.read
			self.readline = self.buffer.readline
		else:
			self.write = lambda s: self.buffer.write(s.encode('ascii'))
			self.read = lambda : self.buffer.read().decode('ascii')
			self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
import sys

class ostream:

	def __lshift__(self, a):
		sys.stdout.write(str(a))
		return self
cout = ostream()
endl = '\n'

def get_input(a=str):
	return a(input())

def get_int_input():
	return get_input(int)

def get_input_arr(a):
	return list(map(a, input().split()))

def get_int_input_arr():
	return get_input_arr(int)

def solve():
	t = get_int_input()
	for _ in range(t):
		n = get_int_input()
		res = []
		for i in range(n):
			res.append(4 * n - i * 2)
		cout << ' '.join(map(str, res)) << endl

def main():
	solve()
main()


for _ in range(int(input())):
	N = int(input())
	count = 0
	temp = 4 * N
	if N == 2:
		print(4)
		print(6)
	else:
		while count != N:
			if count == 1:
				temp = temp - 4
			else:
				temp = temp - 2
			print(temp)
			count = count + 1


def problem_sol(n):
	arr = [0] * n
	for i in range(n):
		arr[i] = 4 * n - 2 * i
	for i in range(n):
		print(arr[i], end=' ')
	print('')
tests = int(input())
while tests > 0:
	n = int(input())
	problem_sol(n)
	tests -= 1


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from math import ceil, floor, sqrt
from collections import Counter, defaultdict, deque

def int1():
	return int(input())

def map1():
	return map(int, input().split())

def list1():
	return list(map(int, input().split()))
mod = pow(10, 9) + 7

def solve():
	n = int1()
	v = 4 * n
	for i in range(n):
		print(v, end=' ')
		v = v - 2
	print()
for _ in range(int(input())):
	solve()


class Solution:

	@staticmethod
	def arrangement(num):
		if num == 1:
			return [1]
		count = 4 * num
		res = []
		while len(res) != num:
			res.append(count)
			count -= 2
		return res
cases = int(input())
while cases:
	num = int(input())
	val = Solution.arrangement(num)
	print(*val)
	cases -= 1


from sys import stdin, stdout

def INI():
	return int(stdin.readline())

def INL():
	return [int(_) for _ in stdin.readline().split()]

def INS():
	return stdin.readline()

def MOD():
	return pow(10, 9) + 7

def OPS(ans):
	stdout.write(str(ans) + '\n')

def OPL(ans):
	[stdout.write(str(_) + ' ') for _ in ans]
	stdout.write('\n')
t = INI()
for _ in range(t):
	n = INI()
	i = 1
	x = 4 * n
	while i <= n:
		print(x, end=' ')
		x -= 2
		i += 1
	print()


t = int(input())
for i in range(t):
	n = int(input())
	m = 4 * n - 2
	a = 2
	for j in range(n):
		print(m, end=' ')
		m = m - 2
	print()


from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush, heappop
import math
from collections import *
from functools import reduce, cmp_to_key, lru_cache
import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
import sys
M = mod = 10 ** 9 + 7

def factors(n):
	return sorted(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def inv_mod(n):
	return pow(n, mod - 2, mod)

def li():
	return [int(i) for i in input().rstrip().split()]

def st():
	return str(input().rstrip())[2:-1]

def val():
	return int(input().rstrip())

def li2():
	return [str(i)[2:-1] for i in input().rstrip().split()]

def li3():
	return [int(i) for i in st()]
for _ in range(val()):
	n = val()
	l = [4 * n]
	for i in range(n - 1):
		for j in range(l[-1] - 1, -1, -1):
			cantadd = 1
			for k in l:
				if math.gcd(j, k) == 1 or k % j == 0:
					cantadd = 0
					break
			if cantadd:
				l.append(j)
				break
	print(*l)


q = int(input())
while True:
	if q == 0:
		break
	q -= 1
	n = int(input())
	a = []
	for i in range(4 * n, 0, -2):
		ok = True
		for j in a:
			if i % j == 0:
				ok = False
				break
		if ok:
			a.append(i)
		if len(a) == n:
			for i in a:
				print(i, end=' ')


import sys
from math import gcd
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7

def resolve():

	def debug(L):
		for i in range(len(L)):
			for j in range(i + 1, len(L)):
				if gcd(L[i], L[j]) == 1 or L[i] % L[j] == 0 or L[j] % L[i] == 0:
					return False
		return True
	t = int(input())
	for _ in range(t):
		n = int(input())
		res = []
		for i in range(1, n + 1):
			res.append(4 * n - i * 2)
		print(*res)
resolve()


t = int(input())
for tt in range(t):
	n = int(input())
	a = []
	for i in range(4 * n, 4 * n - n * 2, -2):
		print(i, end=' ')
	print()


l = []
t = int(input())
for i in range(t):
	n = int(input())
	for x in range(2 * n, 4 * n - 1):
		if x % 2 == 0:
			l.append(x)
	print(*l)
	l.clear()


import sys
for i in range(int(input())):
	rep = int(input())
	number = rep * 4
	for i in range(rep):
		sys.stdout.write(str(number - i * 2) + ' ')
	sys.stdout.write('\n')


T = int(input())
for t in range(T):
	n = int(input())
	N = 4 * n
	for i in range(n):
		print(N, end=' ')
		N -= 2
	print(' ')


import sys, os.path
from collections import *
from heapq import *
from copy import *
import math
mod = 10 ** 9 + 7
read = lambda : map(int, input().split())
inf = sys.maxsize
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
for t in range(int(input())):
	n = int(input())
	if n == 1:
		print(3)
	else:
		res = [2 * n]
		for i in range(n - 1):
			res.append(res[-1] + 2)
		print(*res)


from collections import deque, defaultdict

def solve():
	n = int(input())
	for i in range(n, 2 * n):
		print(2 * i, end=' ')
	print('')

def main():
	t = 1
	t = int(input())
	for _ in range(t):
		solve()
main()


s = int(input())
for i in range(s):
	n = int(input())
	print(*range(2 * n, 4 * n, 2))


try:
	for _ in range(int(input())):
		x = int(input())
		j = 2 * x
		for _ in range(x):
			print(j, end=' ')
			j += 2
		print('')
except:
	pass


def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)
for _ in range(int(input())):
	n = int(input())
	l = []
	for i in range(2 * n, 4 * (n + 1), 2):
		if len(l) == n:
			break
		l.append(i)
	print(*l)


for _ in range(int(input())):
	n = int(input())
	arr = []
	i = 2 * n
	while len(arr) < n:
		arr.append(str(i))
		i += 2
		if i % (2 * n) == 0:
			i += 2
	print(' '.join(arr))


from __future__ import division, print_function
import os, sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def ii():
	return int(input())

def si():
	return input()

def mi():
	return map(int, input().strip().split(' '))

def msi():
	return map(str, input().strip().split(' '))

def li():
	return list(mi())

def dmain():
	sys.setrecursionlimit(1000000)
	threading.stack_size(1024000)
	thread = threading.Thread(target=main)
	thread.start()
import sys
input = sys.stdin.readline
scanner = lambda : int(input())
string = lambda : input().rstrip()
get_list = lambda : list(read())
read = lambda : map(int, input().split())
get_float = lambda : map(float, input().split())

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def fact(x):
	val = 1
	while x > 0:
		val *= x
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // math.gcd(a, b)

def is_integer(n):
	return math.ceil(n) == math.floor(n)

def nCr(n, k):
	if k > n:
		return 0
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res) % MOD

def comb(n, x):
	(a, b) = (1, 1)
	for i in range(1, x + 1):
		a *= n + 1 - i
		b *= i
	return a // b % MOD

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	if y == 0:
		return 1
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	(prime[0], prime[1]) = (False, False)
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime

def phi(n):
	result = n
	p = 2
	while p * p <= n:
		if n % p == 0:
			while n % p == 0:
				n = n // p
			result = result * (1.0 - 1.0 / float(p))
		p = p + 1
	if n > 1:
		result = result * (1.0 - 1.0 / float(n))
	return int(result)

def is_prime(n):
	if n == 0:
		return False
	if n == 1:
		return True
	for i in range(2, int(n ** (1 / 2)) + 1):
		if not n % i:
			return False
	return True

def next_prime(n, primes):
	while primes[n] != True:
		n += 1
	return n
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
spf = [0 for i in range(MAXN)]

def factoriazation(x):
	res = []
	for i in range(2, int(x ** 0.5) + 1):
		while x % i == 0:
			res.append(i)
			x //= i
	if x != 1:
		res.append(x)
	return res

def factors(n):
	res = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			res.append(i)
			res.append(n // i)
	return list(set(res))

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()

def binary_search(low, high, w, h, n):
	while low < high:
		mid = low + (high - low) // 2
		if check(mid, w, h, n):
			low = mid + 1
		else:
			high = mid
	return low

def check(moves, n):
	val = (moves + 1) // 2
	rem = moves - val
	sol = (val + 1) * (rem + 1)
	return sol < n

def sortSecond(val):
	return val[1]
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
small = 'abcdefghijklmnopqrstuvwxyz'
large = small.upper()
from itertools import permutations
import math
import bisect as bis
import random
import sys
import collections as collect
import functools as fnt
from decimal import Decimal

def solve():
	n = scanner()
	z = 4 * n
	ans = []
	for i in range(n):
		ans.append(z)
		z -= 2
	print(*ans)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
t = scanner()
for i in range(t):
	solve()


for _ in range(int(input())):
	n = int(input())
	k = 4 * n
	for i in range(n):
		print(k - 2 * (i + 1), end=' ')
	print()


for i in range(int(input())):
	n = int(input())
	e = 4 * n
	c = 0
	for j in range(e, n, -2):
		c += 1
		print(j, end=' ')
		if c == n:
			break
		print()


cases = int(input())
N = [int(input()) for _ in range(cases)]
seats = []
for n in N:
	seats.append([str(2 * (n + i)) + ' ' for i in range(n)])
for s in seats:
	print(''.join(s))


import math

def prime(a):
	for i in range(2, int(a ** 0.5) + 1):
		if a % i == 0:
			return 0
	return 1
t = int(input())
for test in range(t):
	tt = 0
	pp = 0
	cc = ''
	ss = ''
	dd = 1
	cnttt = 0
	damn = 1e+18
	ammo = 'FULL'
	n = int(input())
	i = 4 * n
	ans = 0
	while i > 2:
		ans += 1
		print(i, end=' ')
		if ans == n:
			break
		i -= 2
	print()


def kid():
	for i in range(1, n + 1):
		print(4 * n - 2 * i, end=' ')
	print('')
for i in range(int(input())):
	n = int(input())
	kid()


t = int(input())
while t > 0:
	n = int(input())
	k = 2 * n
	while n > 0:
		print(k, end=' ')
		k = k + 2
		n = n - 1
	t = t - 1


t = int(input())
for _ in range(t):
	n = int(input())
	total = 4 * n
	si = 4 * n
	for i in range(n):
		osi = si
		si = si - 2
		if si % osi != 0:
			print(si, end=' ')
	print()


import bisect
import collections
import copy
import functools
import heapq
import itertools
import math
import random
import re
import sys
import time
import string
from typing import List, ValuesView
sys.setrecursionlimit(99999)

def solve(n):

	def f(st):
		ans = [st]
		for i in range(st + 2, 4 * n + 1, 2):
			for j in ans:
				if i % j == 0:
					break
			else:
				ans.append(i)
		return ans
	for st in range(2, 4 * n + 1, 2):
		ks = f(st)
		if len(ks) >= n:
			return ks[:n]
t = int(input())
for _ in range(t):
	n = int(input())
	print(*solve(n))


for _ in range(int(input())):
	n = int(input())
	i = 0
	res = []
	for j in range(n):
		res.append(4 * n - i)
		i += 2
	print(*res)


t = int(input())
for tt in range(t):
	n = int(input())
	i = 4 * n - 2
	k = 0
	while k < n:
		print(i, end=' ')
		i = i - 2
		k += 1


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, copy, functools
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
mod2 = 998244353
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI():
	return [list(map(int, l.split())) for l in sys.stdin.readlines()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def pe(s):
	return print(str(s), file=sys.stderr)

def JA(a, sep):
	return sep.join(map(str, a))

def JAA(a, s, t):
	return s.join((t.join(map(str, b)) for b in a))

def IF(c, t, f):
	return t if c else f

def YES(c):
	return IF(c, 'YES', 'NO')

def Yes(c):
	return IF(c, 'Yes', 'No')

def main():
	t = I()
	rr = []
	for _ in range(t):
		n = I()
		rr.append(JA(range(n * 2, n * 4, 2), ' '))
	return JA(rr, '\n')
print(main())


import sys
input = sys.stdin.buffer.readline
ri = lambda : int(input())
rl = lambda : list(map(int, input().split()))
rs = lambda : input().decode().rstrip('\n\r')
wrt = sys.stdout.write
pr = lambda *args, end='\n': wrt(' '.join([str(x) for x in args]) + end)
xrange = lambda args: reversed(range(args))
cdiv = lambda x, y: -(-x // y)
enum = enumerate
inf = float('inf')
mod = 10 ** 9 + 7
Cases = ri()
for Case in range(Cases):
	n = ri()
	aa = 4 * n - 2
	for i in range(n):
		pr(aa, end=' ')
		aa -= 2
	pr()


for _ in range(int(input())):
	n = int(input())
	a = []
	start = 4 * n
	x = 0
	for i in range(n):
		a.append(start - x)
		x += 2
	print(*a)


tests_count = int(input())
for i in range(tests_count):
	children_count = int(input())
	if children_count == 1:
		print(1)
	elif children_count == 2:
		print(6, 4)
	elif children_count == 3:
		print(4, 6, 10)
	else:
		array = []
		counter = children_count * 2
		for j in range(children_count):
			array.append(counter)
			counter += 2
		print(*array)


for i in range(int(input())):
	a = int(input())
	for j in range(a):
		print(a * 4 - (j + 1) * 2, end=' ')


for _ in range(int(input())):
	n = int(input())
	x = 4 * n
	i = 0
	ans = []
	while i < n:
		ans.append(x)
		i += 1
		x -= 2
	print(*ans)


import sys, math, cmath, time
start_time = time.time()

def solve():
	n = inp()
	q = []
	for i in range(4 * n, 2 * n, -2):
		q.append(i)
	print(*q)

def main():
	global tt
	if not ONLINE_JUDGE:
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	t = 1
	t = inp()
	for tt in range(1, t + 1):
		solve()
	if not ONLINE_JUDGE:
		print('Time Elapsed :', time.time() - start_time, 'seconds')
		sys.stdout.close()

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	return input().strip()

def invr():
	return map(int, input().split())

def counter(a):
	q = [0] * max(a)
	for i in range(len(a)):
		q[a[i] - 1] = q[a[i] - 1] + 1
	return q

def counter_elements(a):
	q = dict()
	for i in range(len(a)):
		if a[i] not in q:
			q[a[i]] = 0
		q[a[i]] = q[a[i]] + 1
	return q

def string_counter(a):
	q = [0] * 26
	for i in range(len(a)):
		q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
	return q

def factorial(n, m=1000000007):
	q = 1
	for i in range(n):
		q = q * (i + 1) % m
	return q

def factors(n):
	q = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			q.append(i)
			q.append(n // i)
	return list(sorted(list(set(q))))

def prime_factors(n):
	q = []
	while n % 2 == 0:
		q.append(2)
		n = n // 2
	for i in range(3, int(n ** 0.5) + 1, 2):
		while n % i == 0:
			q.append(i)
			n = n // i
	if n > 2:
		q.append(n)
	return list(sorted(q))

def transpose(a):
	(n, m) = (len(a), len(a[0]))
	b = [[0] * n for i in range(m)]
	for i in range(m):
		for j in range(n):
			b[i][j] = a[j][i]
	return b

def power_two(x):
	return x and (not x & x - 1)

def ceil(a, b):
	return -(-a // b)

def seive(n):
	a = [1]
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p ** 2, n + 1, p):
				prime[i] = False
		p = p + 1
	for p in range(2, n + 1):
		if prime[p]:
			a.append(p)
	return a

def ncr(n, r):
	return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def npr(n, r):
	return math.factorial(n) // math.factorial(n - r)
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
	input = sys.stdin.readline
main()


import math
t = int(input())
for _ in range(t):
	n = int(input())
	count = 0
	ans = []
	r = 2 * (n - 1)
	if n == 1:
		ans = [2]
	elif n == 2:
		ans = [4, 6]
	else:
		ans.append(r)
		count += 1
		for i in range(r, 4 * n + 1):
			if i % 2 == 0:
				if i != r and i % r != 0 and (count != n):
					ans.append(i)
					count += 1
	print(*ans)


from collections import Counter
import string
import math
import sys
from fractions import Fraction

def array_int():
	return [int(i) for i in sys.stdin.readline().split()]

def vary(arrber_of_variables):
	if arrber_of_variables == 1:
		return int(sys.stdin.readline())
	if arrber_of_variables >= 2:
		return map(int, sys.stdin.readline().split())

def makedict(var):
	return dict(Counter(var))

def printDivisors(n):
	divisors = []
	i = 1
	while i <= math.sqrt(n):
		if n % i == 0:
			if n // i == i:
				divisors.append(i)
			else:
				divisors.extend((i, n // i))
		i = i + 1
	return divisors

def countTotalBits(num):
	binary = bin(num)[2:]
	return len(binary)

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True
for _ in range(vary(1)):
	n = vary(1)
	t = 4 * n - 2
	for i in range(n):
		print(t, end=' ')
		t -= 2
	print()


def gcd(a, b):
	if a > b:
		(a, b) = (b, a)
	res = 1
	for i in range(1, a + 1):
		if a % i == 0 and b % i == 0:
			res = i
	return res

def main(n):
	seats = [4 * n]
	for i in range(4 * n, 4, -2):
		if len(seats) == n:
			seats = map(str, seats)
			return ' '.join(seats)
		appendable = True
		for seat in seats:
			state = gcd(seat, i)
			if state == 1 or state == seat:
				appendable = False
				break
		if appendable:
			seats.append(i)
	seats = map(str, seats)
	return ' '.join(seats)
for _ in range(int(input())):
	n = int(input())
	print(main(n))


for case in range(int(input())):
	n = int(input())
	x = 4 * n // 2
	for i in range(n):
		print(x, end=' ')
		x += 2
	print()


import sys
from collections import defaultdict as df

def ini():
	return int(sys.stdin.readline())

def inp():
	return map(int, sys.stdin.readline().strip().split())

def li():
	return list(map(int, sys.stdin.readline().strip().split()))
for i in range(ini()):
	n = ini()
	l = []
	c = 0
	t = 4 * n
	while 1:
		if c == n:
			break
		l += [t]
		t -= 2
		c += 1
	print(*l)


import sys
t = int(input().strip())
for a0 in range(t):
	n = int(input())
	if n == 1:
		print(4)
	elif n == 2:
		print(4, 6)
	else:
		a = 2 * n - 2
		s = str(a)
		c = a + 2
		for i in range(n):
			if c % a == 0:
				pass
			else:
				s += ' ' + str(c)
			c += 2
		print(s)


test = int(input())
for t in range(test):
	n = int(input())
	ans = n * 4
	for i in range(n):
		print(ans, end=' ')
		ans -= 2
	print()


def solve(a):
	l = []
	for i in range(2 * a, 4 * a, 2):
		l.append(i)
	return l
for _ in range(int(input())):
	a = int(input())
	print(*solve(a))


import sys, math, itertools, collections, copy
input = sys.stdin.readline

def solve():
	n = int(input())
	arr = list(range(4 * n + 1))
	cnt = 0
	for i in range(len(arr) - 1, -1, -2):
		cnt += 1
		print(arr[i], end=' ')
		if cnt >= n:
			break
	print()
for _ in range(int(input())):
	solve()


import sys
import os

def changeStdioToFile():
	path = os.path.dirname(os.path.abspath(__file__))
	sys.stdin = open(f'{path}/input.txt', 'r')
	sys.stdout = open(f'{path}/output.txt', 'w')
t = 1
t = int(input())
for _ in range(t):
	n = int(input())
	print(*[2 * (n + i + 1) for i in range(n)])


from math import *
from cmath import *
from itertools import *
from decimal import *
from fractions import *
from sys import *
for _ in range(int(input())):
	n = int(input()) * 4
	for x in range(n // 4):
		print(n, end=' ')
		n -= 2
	print()


def seat(n):
	seats = []
	for i in range(4 * n, 0, -2):
		if len(seats) == 0:
			seats.append(i)
		else:
			f = 0
			for j in seats:
				if j % i == 0:
					f += 1
			if f == 0:
				seats.append(i)
		if len(seats) == n:
			return seats
t = int(input())
for _ in range(t):
	n = int(input())
	r = seat(n)
	print(*r, sep=' ')


t = int(input())
while t:
	n = int(input())
	res = []
	if n == 1:
		print(4)
	else:
		for i in range(4, 4 * n + 1):
			if i // 2 == n and i % 2 == 0:
				while i <= 4 * n:
					if len(res) == n:
						break
					res.append(i)
					i += 2
				break
		print(*res)
	t -= 1


import sys

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c for j in range(b)] for i in range(a)]

def list3d(a, b, c, d):
	return [[[d for k in range(c)] for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** (-10)
for _ in range(INT()):
	N = INT()
	cur = N * 4
	ans = []
	for _ in range(N):
		ans.append(cur)
		cur -= 2
	print(*ans)


import io
import os
from collections import Counter, defaultdict, deque

def solve(N):
	ans = []
	for x in reversed(range(2, 4 * N + 1, 2)):
		if all((x % y != 0 and y % x != 0 for y in ans)):
			if len(ans) < N:
				ans.append(x)
			else:
				break
	assert len(ans) == N
	return ' '.join(map(str, ans))
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
TC = int(input())
for tc in range(1, TC + 1):
	(N,) = [int(x) for x in input().split()]
	ans = solve(N)
	print(ans)


t = int(input())
for i in range(0, t):
	m = int(input())
	l = []
	k = 4 * m
	for i in range(0, m):
		l.append(k)
		k -= 2
	print(*l, sep=' ')


for t in range(int(input())):
	n = int(input())
	k = 2 * n
	while n:
		print(k, end=' ')
		k += 2
		n -= 1
	print()


for _ in range(int(input())):
	n = int(input())
	res = [i for i in range(2 * n, 4 * n, 2)]
	print(*res)


import sys
input = sys.stdin.readline
from collections import defaultdict as dc
from collections import Counter
from bisect import bisect_right, bisect_left
import math
from heapq import heapify, heappop, heappush
for _ in range(int(input())):
	n = int(input())
	p = [4 * n]
	x = 4 * n - 2
	c = 1
	while c < n and x > 0:
		p.append(x)
		c += 1
		if x - 2 > 0:
			x -= 2
	print(*p)


for i in range(int(input())):
	n = int(input())
	a = n * 4 + 2
	b = n * 4 // 2 + 2
	x = []
	for j in range(b, a, 2):
		x.append(j)
	print(*x)


for _ in range(int(input())):
	n = int(input())
	(count, m) = (0, [])
	a = n * 4
	while count < n:
		a = a - 2
		m.append(str(a))
		count += 1
	print(' '.join(m))


t = int(input())
for _ in range(t):
	n = int(input())
	x = 4 * n
	r = []
	for i in range(n):
		r.append(x)
		x = x - 2
	print(*r)


import math
test = int(input())

def testCase():
	n = int(input())
	for i in range(4 * n, 2 * n, -2):
		print(i, end=' ')
	print()
while test:
	test -= 1
	testCase()


import time, math as mt, bisect as bs, sys
from sys import stdin, stdout
from collections import deque
from fractions import Fraction
from collections import Counter
from collections import OrderedDict
pi = 3.141592653589793

def II():
	return int(stdin.readline())

def IP():
	return map(int, stdin.readline().split())

def L():
	return list(map(int, stdin.readline().split()))

def P(x):
	return stdout.write(str(x) + '\n')

def PI(x, y):
	return stdout.write(str(x) + ' ' + str(y) + '\n')

def lcm(a, b):
	return a * b // gcd(a, b)

def gcd(a, b):
	if a == 0:
		return b
	elif b == 0:
		return a
	if a > b:
		return gcd(a % b, b)
	else:
		return gcd(a, b % a)

def bfs(adj, v):
	visited = [False] * (v + 1)
	q = deque()
	while q:
		pass

def sieve():
	li = [True] * (2 * 10 ** 5 + 5)
	(li[0], li[1]) = (False, False)
	for i in range(2, len(li), 1):
		if li[i] == True:
			for j in range(i * i, len(li), i):
				li[j] = False
	prime = []
	for i in range(2 * 10 ** 5 + 5):
		if li[i] == True:
			prime.append(i)
	return prime

def setBit(n):
	count = 0
	while n != 0:
		n = n & n - 1
		count += 1
	return count
mx = 10 ** 7
spf = [mx] * (mx + 1)

def SPF():
	spf[1] = 1
	for i in range(2, mx + 1):
		if spf[i] == mx:
			spf[i] = i
			for j in range(i * i, mx + 1, i):
				if i < spf[j]:
					spf[j] = i
	return

def readTree(n, e):
	adj = [set() for i in range(n + 1)]
	for i in range(e):
		(u1, u2) = IP()
		adj[u1].add(u2)
	return adj
mod = 10 ** 9 + 7

def solve():
	n = II()
	if n == 1:
		print(1)
	else:
		li = [4 * n - 2]
		cnt = 1
		for i in range(4 * n, 0, -1):
			if i in li:
				continue
			ok = 0
			for ele in li:
				if gcd(ele, i) != 1 and i % ele != 0 and (ele % i != 0):
					ok += 1
			if ok == cnt:
				li.append(i)
				cnt += 1
			if cnt == n:
				break
		print(*li)
	return
t = II()
for i in range(t):
	solve()


T = int(input())
for _ in range(T):
	n = int(input())
	if n == 1:
		print(2)
		continue
	x = 4 * n - 2
	l = []
	for i in range(n):
		l.append(x)
		x -= 2
	print(*l)


import math
t = int(input())
for _ in range(t):
	n = int(input())
	chairs = [4 * n]
	i = 4 * n - 2
	while len(chairs) < n:
		for chair in chairs:
			if chair % i == 0:
				break
		else:
			chairs.append(i)
		i -= 2
	print(*chairs)


t = int(input())
for j in range(t):
	n = int(input())
	print(' '.join([str(2 * (n + i)) for i in range(n)]))


import sys, math
import io, os
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter
from itertools import permutations, combinations

def data():
	return sys.stdin.readline().strip()

def mdata():
	return list(map(int, data().split()))

def outl(var):
	sys.stdout.write(' '.join(map(str, var)) + '\n')

def out(var):
	sys.stdout.write(str(var) + '\n')
sys.setrecursionlimit(100000)
INF = float('inf')
mod = 998244353
for t in range(int(data())):
	n = int(data())
	ans = list(range(4 * n, 4 * n - 2 * n, -2))
	outl(ans)


def solve():
	n = int(input())
	st = n * 2
	nogo = set()
	ans = []
	while n > 0:
		if st in nogo:
			ans.append(st + n)
		else:
			ans.append(st)
			nogo.add(st * 2)
		st += 2
		n -= 1
	print(' '.join((str(v) for v in ans)))
t = int(input())
for _ in range(t):
	solve()


import math
t = int(input())
while t:
	n = int(input())
	a = []
	a.append(4)
	for i in range(2, 4 * n + 1, 2):
		flag = 0
		for j in range(len(a)):
			x = math.gcd(a[j], i)
			if x == 1 or a[j] % i == 0 or i % a[j] == 0:
				if flag == 0:
					num = a[j]
				flag += 1
		if flag == 0:
			a.append(i)
		elif flag == 1:
			a.remove(num)
			a.append(i)
	for i in range(n):
		print(a[i], end=' ')
	print(' ')
	t -= 1


t = int(input())
while t:
	t -= 1
	n = int(input())
	if n == 1:
		print(1)
	else:
		i = 0
		j = 4 * n
		while i < n:
			i += 1
			print(j, end=' ')
			j -= 2


import math, sys, os
from io import BytesIO, IOBase
mod = 10 ** 9 + 7
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def minp():
	return map(int, sys.stdin.readline().rstrip().split())

def linp():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def inp():
	return int(input())

def print_list(l):
	print(' '.join(map(str, l)))
for _ in range(inp()):
	n = inp()
	start = 2 * n
	for i in range(n):
		print(start, end=' ')
		start += 2
	print()


answers = [[] for i in range(102)]
for num in range(1, 100 + 1):
	limit = 4 * num
	numbers = []
	for i in range(limit, 1, -2):
		if not any((j % i == 0 for j in numbers)):
			numbers.append(i)
	answers[num] = numbers[:num]
for t in range(int(input())):
	print(' '.join(map(str, answers[int(input())])))


def main():
	n = int(input())
	for _ in range(n):
		count = int(input())
		exep = dict()
		counter = 0
		for i in range(count * 2, count * 4 + 1, 2):
			if exep.get(i) is None:
				k = 1
				while k * i < count * 4 + 1:
					exep[k * i] = 1
					k += 1
				print(i, end=' ')
				counter += 1
			if count == counter:
				break
		print()
main()


for test in range(int(input())):
	n = int(input())
	ans = []
	for i in range(n):
		ans.append(4 * n - 2 * i)
	print(*ans, sep=' ')


t = int(input())
for i in range(t):
	n = int(input())
	ans = []
	cur = 4 * n
	for j in range(n, 0, -1):
		ans.append(cur)
		cur -= 2
	print(*ans)


import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
import string
ORDA = 97

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return [int(i) for i in input().split()]

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def revn(n):
	return str(n)[::-1]

def dd():
	return collections.defaultdict(int)

def ddl():
	return collections.defaultdict(list)

def sieve(n):
	if n < 2:
		return list()
	prime = [True for _ in range(n + 1)]
	p = 3
	while p * p <= n:
		if prime[p]:
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 2
	r = [2]
	for p in range(3, n + 1, 2):
		if prime[p]:
			r.append(p)
	return r

def divs(n, start=2):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def divn(n, primes):
	divs_number = 1
	for i in primes:
		if n == 1:
			return divs_number
		t = 1
		while n % i == 0:
			t += 1
			n //= i
		divs_number *= t

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base):
	new_number = 0
	while number > 0:
		new_number += number % base
		number //= base
	return new_number

def cdiv(n, k):
	return n // k + (n % k != 0)

def ispal(s):
	for i in range(len(s) // 2 + 1):
		if s[i] != s[-i - 1]:
			return False
	return True
for _ in range(ii()):
	n = ii()
	print(*[i for i in range(2 * n + 2, 4 * n + 2, 2)])


for z in range(int(input())):
	n = int(input())
	num = 4 * n
	while n > 0:
		print(num, end=' ')
		num = num - 2
		n -= 1
	print()


for s in [*open(0)][1:]:
	n = int(s)
	print(*(x for x in range(2 * n + 2, 4 * n + 2, 2)))


t = int(input())
while t:
	x = int(input())
	j = x
	l = []
	for i in range(x):
		l.append(2 * j)
		j += 1
	print(*l)
	t = t - 1


t = int(input())
while t:
	t -= 1
	n = int(input())
	init = n * 2
	for i in range(n):
		if i != 0:
			init += 2
		print(init, sep=' ', end=' ')
	print()


from sys import stdin, stdout
from collections import *
from math import gcd, floor, ceil
from bisect import bisect_left as bl
st = lambda : list(stdin.readline().strip())
li = lambda : list(map(int, stdin.readline().split()))
mp = lambda : map(int, stdin.readline().split())
inp = lambda : int(stdin.readline())
pr = lambda n: stdout.write(str(n) + '\n')
INF = float('inf')
mod = 1000000007

def solve():
	n = inp()
	val = 4 * n
	cur = []
	for _ in range(n):
		cur.append(val)
		val -= 2
	pr(' '.join(map(str, cur)))
for _ in range(inp()):
	solve()


import math
import sys

def chek(m, b, c, li):
	for i in range(li):
		if m[i] + b[i] > c:
			return False
	return True
input = lambda : sys.stdin.readline().rstrip()
f = int(input())
for _ in range(f):
	n = int(input())
	n = n * 4
	for i in range(n, n // 2, -1):
		if i % 2 == 0:
			print(i, end=' ')
	print()


from sys import stdin, stdout
input = stdin.readline
print = lambda x: stdout.write(str(x) + '\n')
for _ in range(int(input())):
	n = int(input())
	ans = list(range(4 * n, 4 * n - (n - 1) * 2 - 1, -2))
	ans = ' '.join(map(str, ans))
	print(ans)


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	l = []
	i = 0
	x = 2 * n
	while i != n:
		l.append(x)
		x += 2
		i += 1
	print(*l)


for _ in range(int(input())):
	n = int(input())
	for j in range(n):
		print(4 * n - 2 * j, end=' ')
	print()


for i in range(int(input())):
	n = int(input())
	a = 1
	c = []
	count = 0
	a = 4 * n
	while True:
		if count == n:
			break
		c.append(a)
		a -= 2
		count += 1
	print(*c)


def solve():
	n = int(input())
	print(*list(range(2 * n + 2, 4 * n + 1, 2)))

def main():
	t = 1
	t = int(input())
	for _ in range(t):
		solve()
main()


t = int(input())
for i in range(0, t):
	n = int(input())
	a = []
	a.append(4 * n - 2)
	for j in range(1, n):
		x = 4 * n - (j + 1) * 2
		a.append(4 * n - (j + 1) * 2)
	for k in a:
		print(k, end=' ')


from math import gcd
t = int(input())
for _ in range(t):
	n = int(input())
	ans = [2 + 4 * ((n + 1) // 3)]
	for a in range(ans[0] + 1, 4 * n + 1):
		if all([a % b != 0 and gcd(a, b) != 1 for b in ans]):
			ans.append(a)
	print(' '.join(map(str, ans[:n])))


def function_1(value):
	result_list = list()
	res_value = value * 2
	for i in range(value):
		res_value = res_value + 2
		result_list.append(res_value)
	return result_list
n = int(input())
for i in range(n):
	value = int(input())
	result = function_1(value)
	print(*result)


t = int(input())
for t1 in range(0, t):
	n = int(input())
	i = 2 * n
	ans = []
	d = 0
	for j in range(0, n):
		ans.append(i + d)
		d += 2
	print(*ans)


t = int(input())
for p in range(t):
	n = int(input())
	a = [2 * n]
	for i in range(n - 1):
		a.append(a[i] + 2)
	print(*a)


t = int(input())
import math
for _ in range(t):
	n = int(input())
	ans = []
	if n % 2 == 1:
		for i in range(n):
			if i <= n // 2:
				continue
			ans.append(4 * i + 2)
			ans.append(4 * i + 4)
		ans.append(4 * (n // 2) + 4)
	else:
		for i in range(n):
			if i <= n // 2 - 1:
				continue
			ans.append(4 * i + 2)
			ans.append(4 * i + 4)
	print(*ans[0:n])


for _ in range(int(input())):
	n = int(input())
	a = [4 * n]
	for i in range(4 * n, 4, -2):
		for j in a:
			if i % j == 0 or j % i == 0:
				break
		else:
			a.append(i)
	a = a[:n]
	print(*a)


t = int(input())
for i in range(t):
	n = int(input())
	if n == 1:
		print(2)
	elif n == 2:
		print(4, 6)
	else:
		arr = []
		for i in range(4 * n, 0, -2):
			arr.append(i)
			if len(arr) == n:
				break
		print(*arr)


def get_ans(num):
	a = num * 4
	ans = str(a)
	for i in range(num - 1):
		a -= 2
		ans = ans + ' ' + str(a)
	return ans
anss = []
t = int(input())
for _ in range(t):
	anss.append(get_ans(int(input())))
for i in anss:
	print(i)


def judge(a):
	x = [2 * a]
	for i in range(a - 1):
		x.append(x[i] + 2)
	for i in x:
		print(i, end=' ')
t = eval(input())
a = []
while t:
	tmp = eval(input())
	a.append(tmp)
	t = t - 1
for i in a:
	judge(i)
	print()


t = int(input())
m = []
for i in range(t):
	n = int(input())
	m.append([])
	l = n * 2 + n * 2
	for j in range(n * 2, l, 2):
		m[i].append(j)
for i in m:
	print(*i)


a = int(input())
for j in range(a):
	n = int(input())
	ans = []
	for i in range(4 * n, 4 * n - (n - 1) * 2 - 1, -2):
		ans.append(str(i))
	print(' '.join(ans))


for _ in range(int(input())):
	N = int(input())
	x = 4 * N
	while N:
		print(x, end=' ')
		x -= 2
		N -= 1
	print()


for _ in range(int(input())):
	n = int(input())
	for i in range(4 * n, 4 * n - 2 * n, -2):
		print(i, sep=' ')


from __future__ import division, print_function
import os, sys
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def ii():
	return int(input())

def fi():
	return float(input())

def si():
	return input()

def msi():
	return map(str, input().split())

def mi():
	return map(int, input().split())

def li():
	return list(mi())

def read():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def lcm(x, y):
	return x * y // gcd(x, y)
mod = 1000000007

def modInverse(b, m):
	g = gcd(b, m)
	if g != 1:
		return -1
	else:
		return pow(b, m - 2, m)

def modu(a, b, m):
	a = a % m
	inv = modInverse(b, m)
	if inv == -1:
		return -999999999
	else:
		return inv * a % m
from math import log, sqrt, factorial, cos, tan, sin, radians, floor, ceil
import bisect
from decimal import *
getcontext().prec = 8
abc = 'abcdefghijklmnopqrstuvwxyz'
pi = 3.141592653589793

def gcd1(a):
	if len(a) == 1:
		return a[0]
	ans = a[0]
	for i in range(1, len(a)):
		ans = gcd(ans, a[i])
	return ans

def main():
	for _ in range(ii()):
		n = ii()
		l = []
		x = 4 * n
		for i in range(n):
			l.append(x)
			x -= 2
		print(*l)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


for s in [*open(0)][1:]:
	N = int(s)
	print(*range(2 * N, 4 * N, 2))


def solve():
	n = int(input())
	if n >= 3:
		ans = [2 * n + 2 * (i + 1) for i in range(n)]
		print(*ans)
	elif n == 2:
		print(*[6, 4])
	elif n == 1:
		print(1)
	return

def main():
	t = int(input())
	for i in range(t):
		solve()
	return
main()


def solve(t):
	n = int(input())
	for i in range(n):
		print(2 * n + 2 * i, end=' ')
	print()

def main():
	T = int(input())
	for t in range(T):
		solve(t + 1)
main()


t = int(input())
for _ in range(t):
	n = int(input())
	i = 2 * n
	x = i
	a = []
	while n > 0:
		n -= 1
		a.append(i)
		i += 2
	print(*a)


cases = int(input())
for t in range(cases):
	n = int(input())
	d = []
	c = 0
	for i in range(4 * n, 0, -2):
		if c < n:
			d.append(i)
			c += 1
		else:
			break
	print(*d)


t = int(input())
for i in range(t):
	n = int(input())
	s = ''
	k = 4 * n
	for i in range(n):
		s = s + str(k) + ' '
		k = k - 2
	print(s)


from math import gcd
T = int(input())
for t in range(T):
	n = int(input())
	spacing = list(range(4 * n, 2 * n, -2))
	print(*spacing)


import sys
NMax = 101

def get_n(n):
	k = {2 + 2 * i for i in range(1, (4 * n - 2) // 2 + 1)}
	k_op = reversed(list(k))
	for x in k_op:
		for i in range(2, x, 2):
			if x % i == 0:
				if i in k:
					k.remove(i)
	return list(k)
t = int(sys.stdin.readline().strip())
for i in range(t):
	n = int(sys.stdin.readline().strip())
	print(' '.join(map(str, get_n(n)[:n])))


for tc in range(int(input())):
	n = int(input())
	count = 0
	if n == 1:
		print('1')
		continue
	summ = 4 * n
	for i in range(n):
		print(summ, end=' ')
		summ -= 2
	print(' ')


for _ in range(int(input())):
	n = int(input())
	evens = [x for x in range(2 * n, 3000) if x % 2 == 0]
	cur = []
	for num in evens:
		flag = True
		for elem in cur:
			if num % elem == 0:
				flag = False
		if flag:
			cur.append(num)
	print(*cur[:n])


def string_list(s, char):
	output_list = []
	intermediator = ''
	for i in range(len(s)):
		if s[i] != char:
			intermediator += s[i]
			if i == len(s) - 1:
				output_list.append(int(intermediator))
		elif intermediator:
			output_list.append(int(intermediator))
			intermediator = ''
	return output_list

def list_string(l, char):
	output_str = ''
	for i in range(len(l) - 1):
		output_str += str(l[i]) + char
	output_str += str(l[len(l) - 1])
	return output_str

def merge_sort(l):

	def merge(l1, l2):
		(i, j) = (0, 0)
		output_list = []
		while i < len(l1) and j < len(l2):
			if l1[i] < l2[j]:
				output_list.append(l1[i])
				i += 1
			else:
				output_list.append(l2[j])
				j += 1
		if i == len(l1):
			output_list += l2[j:]
		else:
			output_list += l1[i:]
		return output_list

	def sorts(l):
		if len(l) < 2:
			return l
		else:
			mid = len(l) // 2
			left = sorts(l[:mid])
			right = sorts(l[mid:])
			return merge(left, right)
	return sorts(l)

def main_function():
	output_list = []
	t = int(input())
	for i in range(t):
		n = int(input())
		output_list.append(list_string([4 * n - i for i in range(2 * n) if not i % 2], ' '))
	return list_string(output_list, '\n')
print(main_function())


t = int(input())
while t:
	n = int(input())
	print(' '.join(map(str, range(n << 2, 1 + (n << 1), -2))))
	t -= 1


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	arr = []
	arr.append(4 * n)
	x = 4 * n - 2
	while len(arr) <= n - 1:
		accept = 0
		for item in arr:
			if item % x == 0:
				accept = 1
		if accept == 0 and x > 0:
			arr.append(x)
		else:
			x -= 2
	ans = ''
	for item in arr:
		ans += str(item) + ' '
	print(ans)


t = int(input())
for c in range(t):
	n = int(input())
	sol = []
	for i in range(n):
		sol.append(str(4 * n - 2 * i))
	print(' '.join(sol))


def testcase():
	n = int(input())
	x = 4 * n
	for i in range(n):
		print(x, end=' ')
		x -= 2
	print()
	return
import sys, os
if os.path.exists('input.txt'):
	sys.stdin = open('input.txt', 'r')
sys.setrecursionlimit(10 ** 5)
t = int(input())
for _ in range(t):
	testcase()


ans = [4, 6]
for i in range(200):
	ans.append(ans[-1] + 4)
a = int(input())
for i in range(a):
	t = int(input())
	if t == 2:
		print(4, 6)
		continue
	ans = []
	ans.append(2 * t - 2)
	for i in range(1, t):
		ans.append(ans[-1] + 2)
	ans[-1] += 2
	print(*ans)


import sys
import math
input = sys.stdin.buffer.readline

def solution():
	n = int(input())
	cnt = 0
	l = []
	for i in range(4 * n, -1, -1):
		if len(l) == n:
			break
		flag = 0
		for x in l:
			if i % x == 0 or math.gcd(x, i) == 1:
				flag = 1
				break
		if flag == 0:
			l.append(i)
	print(*l)
t = int(input())
for _ in range(t):
	solution()


t = int(input())
for i in range(t):
	n = int(input())
	lst = []
	for i in range(n):
		x = 2 * (n + i)
		lst.append(x)
	print(*lst)


import sys
import inspect
import re
if __name__ == 'CP':
	sys.stdin = open('ip.txt', 'r')
	sys.stdout = open('op.txt', 'w')

def debug(arg):
	frame = inspect.currentframe()
	try:
		context = inspect.getframeinfo(frame.f_back).code_context
		caller_lines = ''.join([line.strip() for line in context])
		m = re.search('debug\\s*\\((.+?)\\)$', caller_lines)
		if m:
			caller_lines = m.group(1)
		sys.stderr.write(caller_lines + ' = ' + str(arg) + '\n')
	finally:
		del frame
try:

	def main():
		t = 1
		t = int(sys.stdin.readline())
		while t:
			n = int(sys.stdin.readline())
			for i in range(n):
				sys.stdout.write(str(2 * (n + i)) + ' ')
			sys.stdout.write(str('\n'))
			t -= 1
	main()
except Exception as e:
	sys.stdout.write('ErrOR : ' + str(e))


t = int(input())
for q in range(t):
	n = int(input())
	L = [4 * n - 2]
	ch = ''
	while len(L) < n:
		L.append(L[-1] - 2)
	for i in range(n):
		ch += str(L[i]) + ' '
	print(ch)


def f(n: int):
	a = list()
	for i in range(n):
		j = 4 * n - 2 * i
		a.append(j)
	for i in a:
		print(i, end=' ')
t = int(input())
for i in range(t):
	n = int(input())
	f(n)


def fun(n):
	ls = [i for i in range(2 * n, 4 * n, 2)]
	print(*ls)
T = int(input())
for i in range(T):
	t = int(input())
	fun(t)


def solv():
	x = int(input())
	cur = 4 * x
	for n in range(x):
		print(cur, end=' ')
		cur -= 2
	print()
for _ in range(int(input())):
	solv()


from os import path
import sys
from heapq import heappush, heappop
from functools import cmp_to_key as ctk
from collections import deque, defaultdict as dd
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from itertools import permutations
from datetime import datetime
from math import ceil, sqrt, log, gcd

def ii():
	return int(input())

def si():
	return input().rstrip()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
abc = 'abcdefghijklmnopqrstuvwxyz'
mod = 998244353
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def bo(i):
	return ord(i) - ord('a')
file = 1

def solve():
	for _ in range(ii()):
		n = ii()
		f = [0] * (4 * n + 1)
		a = []
		for i in range(4 * n, -1, -2):
			if i <= 2 * n and f[2 * i] == 1:
				break
			if f[i] == 0:
				f[i] = 1
				a.append(i)
		print(*a)
if file:
	if path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	else:
		input = sys.stdin.readline
solve()


for _ in range(int(input())):
	n = int(input())
	print(*[n + i << 1 for i in range(n, 0, -1)])


import os
from io import BytesIO, IOBase
import sys
from collections import defaultdict, deque, Counter
from bisect import *
from math import sqrt, pi, ceil, log, inf, gcd
from itertools import permutations
from copy import deepcopy
from heapq import *
from sys import setrecursionlimit

def main():
	for _ in range(int(input())):
		n = int(input())
		b = []
		for i in range(2 * n, 4 * n + 1, 2):
			b.append(i)
			if len(b) == n:
				break
		print(*b)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


for i in range(int(input())):
	n = int(input())
	seat = n * 4
	li = []
	for j in range(n):
		li.append(seat - 2)
		seat -= 2
	print(*li, sep=' ')


import collections
import math
from heapq import *
for t in range(int(input())):
	n = int(input())
	out = []
	base = 4 * n
	for i in range(n):
		while out and out[-1] % base == 0:
			base -= 2
		out.append(base)
		base -= 2
	print(*out)


import bisect
import math

def solve(n):
	ans = []
	for j in range(4 * n, -1, -2):
		ans.append(j)
	return ans[:n]
	pass
t = int(input())
ans = []
for i in range(t):
	n = int(input())
	ans.append(solve(n))
for test in ans:
	for ele in test:
		print(ele, end=' ')
	print()


for _ in range(int(input())):
	n = int(input())
	res = []
	for i in range(4 * n, 2 * n, -2):
		res.append(i)
	res = list(map(str, res))
	print(' '.join(res))


out = []
for _ in range(int(input())):
	n = int(input())
	(ans, cur) = ([n * 4], n * 4 - 2)
	while len(ans) < n:
		if not list(filter(lambda x: x % cur == 0, ans)):
			ans.append(cur)
		cur -= 2
	out.append(' '.join(map(str, ans)))
print('\n'.join(out))


import math
for _ in range(int(input())):
	n = int(input())
	ans = []
	for i in range(4 * n, 0, -2):
		ans.append(i)
	print(*ans[:n])


from sys import stdin
import sys
tt = int(stdin.readline())
for loop in range(tt):
	n = int(stdin.readline())
	ans = []
	for i in range(n):
		ans.append(4 * n - i * 2)
	print(*ans)


a = int(input())
for i in range(a):
	b = int(input())
	arr = []
	for i in range(b):
		arr.append(2 * b + 2 * i)
	print(' '.join(map(str, arr)))


t = int(input())
while t:
	n = int(input())
	l1 = []
	for i in range(2 * n, 4 * n, 2):
		l1.append(i)
	print(*l1)
	t = t - 1


def solve():
	N = int(input())
	res = []
	for j in range(N):
		res.append((N + j) * 2)
	print(*res)
	return
for _ in range(int(input())):
	solve()


for _ in range(int(input())):
	n = int(input())
	ini = 4
	while ini < 2 * n:
		ini += 4
	temp = [ini, ini + 2]
	s = ini + 2
	while len(temp) < n:
		s += 2
		for i in temp:
			if s % i == 0:
				f = 0
				break
			else:
				f = 1
		if f == 1:
			temp.append(s)
	print(*temp[:n])


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	ans = []
	num = 4 * n
	while n > 0:
		n -= 1
		ans.append(num)
		num -= 2
	print(*ans)


from collections import defaultdict
from functools import reduce
from bisect import bisect_right
from bisect import bisect_left
import copy

def main():
	for _ in range(int(input())):
		n = int(input())
		ans = []
		for i in range(4 * n - 1, 1, -1):
			if i % 2 == 0:
				ans.append(str(i))
		print(' '.join(ans[:n]))
main()


def zip_sorted(a, b):
	(a, b) = zip(*sorted(zip(a, b)))
	sorted(zip(a, b), key=lambda x: x[1])
	return (a, b)
import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
S = lambda : list(map(str, input().split()))
(t,) = I()
for t1 in range(t):
	(n,) = I()
	i = 4 * n
	while i > 2 * n:
		print(i)
		i = i - 2


for _ in range(int(input())):
	n = int(input())
	t = 2 * n
	while t < 4 * n:
		print(t, end=' ')
		t += 2
	print()


for _ in range(int(input())):
	n = int(input())
	d = {}
	a = []
	s = n * 2
	case = True
	while True:
		if len(a) == n:
			break
		elif len(d) == 0:
			a.append(s)
			d[s] = 1
			s += 2
		else:
			for j in d:
				if s % j == 0:
					case = False
					break
			if case:
				d[s] = 1
				a.append(s)
			s += 2
	print(*a)


t = int(input())
while t:
	n = int(input())
	ans = 4 * n
	count = 0
	while True:
		print(ans, end=' ')
		count += 1
		ans = ans - 2
		if count == n:
			break
	print()
	t -= 1


from sys import stdout, stdin
from collections import defaultdict, deque
import math
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	z = 4 * n
	for i in range(n):
		print(z, end=' ')
		z -= 2
	print()


t = int(input())
import math
for _ in range(t):
	n = int(input())
	i = 4 * n
	a = set()
	while i >= 1 and len(a) != n:
		flag = 1
		for j in a:
			if math.gcd(j, i) == min(i, j):
				flag = 0
		if flag == 1:
			a.add(i)
		i -= 2
	for i in a:
		print(i, end=' ')
	print()


from sys import stdin, stdout
t = int(input())
for _ in range(t):
	n = int(input())
	arr = []
	for i in range(4 * n, 3, -2):
		for j in arr:
			if j % i == 0 or i % j == 0:
				break
		else:
			arr.append(i)
		if len(arr) == n:
			break
	print(*arr)
	assert len(arr) == n


from math import *
t = int(input())
for _ in range(t):
	n = int(input())
	s = 2 * n
	for i in range(n):
		s = s + 2
		print(s, end=' ')
	print()


import math
t = int(input())
while t:
	n = int(input())
	for i in range(2 * n + 2, 4 * n + 1, 2):
		print(i, end=' ')
	print()
	t -= 1


def computegcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def divcheck(ans, num):
	flag = True
	for x in ans:
		if num % x == 0 or x % num == 0 or computegcd(x, num) == 1:
			flag = False
			break
	return flag
t = int(input())
final = []
for i in range(t):
	ans = []
	n = int(input())
	if n == 1:
		ans.append(1)
		final.append(ans)
		continue
	l = list(range(2, 2 * n + 1))
	l.reverse()
	k = 0
	u = 0
	while k < n:
		r = l[u] * 2
		u = u + 1
		if divcheck(ans, r) == True and r < n * 4:
			ans.append(r)
			k = k + 1
	final.append(ans)
for k in final:
	for j in k:
		print(j, end=' ')
	print()


for t in range(int(input())):
	n = int(input())
	tables = [2 * n]
	for i in range(2 * n + 2, 4 * n, 2):
		flag = True
		for chair in tables:
			if i % chair == 0:
				flag = False
		if flag:
			tables.append(i)
	if len(tables) != n:
		for k in range(2 * n - 2, 2, -2):
			flag = True
			for chair in tables:
				if chair % k == 0:
					flag = False
			if flag:
				tables.append(k)
	for chair in tables:
		print(chair, end=' ')
	print('')


for _ in range(int(input())):
	n = int(input())
	if n == 1:
		print('2')
		continue
	for i in range(4 * n, 2 * n + 1, -2):
		if i % 2 == 0:
			print(i, end=' ')
	print()


cases = int(input())
for z in range(0, cases):
	num = int(input())
	count = 0
	value = 4 * num
	ans = ''
	while count < num:
		ans += str(value) + ' '
		value -= 2
		count += 1
	print(ans)


def solve(n):
	big = float('inf')
	small = float('-inf')
	ans = [4 * n - 2]
	while len(ans) < n:
		ans.append(ans[-1] - 2)
	return ans

def isPrime(n):
	for i in range(2, int(n ** 0.5) + 1):
		if n % i == 0:
			return False
	return True

def main():
	t = int(input())
	for i in range(t):
		n = int(input())
		ans = solve(n)
		for i in ans:
			print(i, end=' ')
		print()
main()


for _ in range(int(input())):
	n = int(input())
	k = 4 * n - 2
	l = []
	c = 0
	for j in range(k, 0, -2):
		if c == n:
			break
		l.append(j)
		c += 1
	print(*l)


from sys import stdin, stdout
for _ in range(int(stdin.readline())):
	n = int(stdin.readline())
	ans = []
	if n == 1:
		print(2)
		continue
	add = 4 * n
	while len(ans) != n:
		ans += [add]
		add -= 2
	print(*ans)


for _ in range(int(input())):
	N = int(input())
	for i in range(N):
		print(4 * N - i * 2, end=' ')
	print()


import sys, threading, os.path
import string
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2 ** 27)

def main():
	if os.path.exists('in.rtf'):
		input = open('in.rtf', 'r')
	else:
		input = sys.stdin
	t = int(input.readline())
	results = []
	for i in range(t):
		n = int(input.readline())
		result = [4 * n]
		for j in range(n - 1):
			for y in range(result[len(result) - 1], -1, -2):
				works = True
				for z in result:
					if y % z == 0:
						works = False
						break
				if works == True:
					result.append(y)
					break
		results.append(result)
	output = '\n'.join((' '.join(map(str, re)) for re in results))
	if os.path.exists('out.rtf'):
		open('out.rtf', 'w').writelines(str(output))
	else:
		sys.stdout.write(str(output))
main()


import os
import sys
from io import BytesIO, IOBase
input = sys.stdin.readline

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())

def main():
	try:
		from math import gcd
		for _ in range(inp()):
			n = inp()
			for i in range(n):
				print(4 * n - 2 * i, end=' ')
			print('')
	except Exception as e:
		print(e)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


def gcd(a, b):
	if a > b:
		(a, b) = (b, a)
	while a:
		(b, a) = (a, b % a)
	return b
res = [4]
for _ in range(int(input())):
	n = int(input())
	i = 4 * n
	res = [i]
	while len(res) < n:
		i -= 2
		res.append(i)
	print(*res)


def myfun(n):
	i = 1
	cnt = 0
	while i < n:
		i *= 2
		cnt += 1
	return cnt + 1
for _ in range(int(input())):
	n = int(input())
	i = 0
	for j in range(n):
		print(4 * n - i, end=' ')
		i += 2
	print('')


import sys
import itertools as it
import math as mt
import bisect as bi
import collections as cc
import itertools as it
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
ar = [4, 10]
for i in range(100):
	ar.append(ar[-1] + 4)
for tc in range(int(input())):
	(n,) = I()
	if n == 2:
		print(4, 6)
	else:
		cur = 2 * n
		for i in range(n):
			print(cur, end=' ')
			cur += 2
		print()


for i in range(int(input())):
	n = int(input())
	v = [2 * n]
	for i in range(2 * n, 4 * n + 1, 2):
		flag = True
		for x in v:
			if i % x == 0:
				flag = False
				break
		if flag:
			v.append(i)
	for x in v:
		print(x, end=' ')
	print()


import sys, math
mod = 10 ** 9 + 7
md = 998244353
input = lambda : sys.stdin.readline().strip()
inp = lambda : list(map(int, input().split()))
for _ in range(int(input())):
	n = int(input())
	t = 4 * n
	for i in range(n):
		print(t, end=' ')
		t -= 2
	print()


import sys
import math
from collections import defaultdict, Counter
input = sys.stdin.readline
t = int(input())
for i in range(t):
	n = int(input())
	for j in range(2 * n, 4 * n, 2):
		print(j, end=' ')
	print()


from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math
import threading
import sys
import time

def get_int():
	return int(stdin.readline().strip())

def get_tuple():
	return map(int, stdin.readline().split())

def get_list():
	return list(map(int, stdin.readline().split()))

def solve(t, T):
	n = get_int()
	ans = []
	start = 4 * n
	for i in range(n):
		while True:
			flag = True
			for val in ans:
				if start % val == 0 or val % start == 0:
					flag = False
					break
			if flag:
				ans.append(start)
				break
			start -= 2
	print(*ans)

def main(i, t):
	solve(i, t)
TestCases = True
if TestCases:
	t = get_int()
	for i in range(t):
		main(i + 1, t)
else:
	main()


t = int(input())
for _ in range(t):
	n = int(input())
	ans = []
	add = 0
	start = n * 2
	for i in range(n):
		ans.append(start + add)
		add += 2
	print(' '.join((str(i) for i in ans)))


for _ in range(int(input())):
	n = int(input())
	ans = []
	start = 2 * n
	for i in range(n):
		ans.append(start)
		start += 2
	print(*ans)


t = int(input())
res = []
for j in range(0, t):
	n = int(input())
	sol = []
	for i in range(4 * n, 0, -1):
		if len(sol) == n:
			break
		if i % 2 == 0:
			sol.append(str(i))
	res.append(sol)
for i in res:
	print(' '.join(i))


for _ in range(int(input())):
	n = int(input())
	for number in [x for x in range(2 * n, 4 * n)][::2]:
		print(number, end=' ')


import sys
input = sys.stdin.readline
T = int(input())
for _ in range(T):
	n = int(input())
	v = 4 * n
	for i in range(n):
		print(v, end=' ')
		v = v - 2
	print()


t = int(input())
for _ in range(t):
	n = int(input())
	m = n * 4
	for __ in range(n - 1):
		print(m, end=' ')
		m -= 2
	print(m)


from math import gcd
from collections import defaultdict as dd
import sys
input = sys.stdin.readline
t = int(input())
n = 100000
pr = []
prime = [True for i in range(n + 1)]
p = 2
while p * p <= n:
	if prime[p] == True:
		for i in range(p * p, n + 1, p):
			prime[i] = False
	p += 1
for i in range(2, n + 1):
	if prime[i]:
		pr.append(i)
odd = []
curr = 1
for i in range(400):
	odd.append(curr * 2 + 11)
	curr += 1
while t:
	nn = int(input())
	cou = 0
	res = []
	for i in range(min(132, nn * 2), 4 * nn + 1):
		if len(res) == nn:
			break
		lol = 0
		for j in res:
			if i % j == 0 or gcd(i, j) == 1:
				lol = 1
				break
		if lol == 0:
			res.append(i)
	print(*res)
	t -= 1


import math
import sys
from collections import OrderedDict

class Graph:

	def __init__(self, Nodes, is_directed=False):
		self.nodes = Nodes
		self.adj_list = {}
		self.is_directed = is_directed
		for node in self.nodes:
			self.adj_list[node] = []

	def add_edge(self, u, v):
		self.adj_list[u].append(v)
		if self.is_directed == False:
			self.adj_list[v].append(u)

	def print_graph(self):
		for node in self.nodes:
			print(node, '->', self.adj_list[node])

	def degree_node(self, node):
		return len(self.adj_list[node])

	def dfsUTIL(self, v, visited, parents=[]):
		visited[v] = True
		for i in self.adj_list[v]:
			if visited[i] == False:
				self.dfsUTIL(i, visited, parents)
				parents.append(i)

	def dfs(self, v):
		visited = [False] * (max(self.adj_list) + 1)
		parents = [v]
		self.dfsUTIL(v, visited, parents)
		return parents

def factorial(n):
	if n == 0 or n == 1:
		return 1
	ans = 1
	for i in range(2, n + 1):
		ans *= i
	return ans

def dict_sort(ans):
	ans = sorted(ans.items(), reverse=True, key=lambda kv: kv[1])

def is_prime(n):
	if n == 1:
		return 0
	for i in range(2, int(math.sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def seive_primes(n):
	flag = [0] * (n + 2)
	flag[1] = flag[0] = 1
	i = 2
	while i * i <= n + 1:
		if flag[i] == 0:
			j = i * i
			while j <= n + 1:
				flag[j] = 1
				j += i
		i += 1
	return flag

def factors(n):
	d = {}
	while n % 2 == 0:
		if 2 in d:
			d[2] += 1
		else:
			d[2] = 1
		n /= 2
	for i in range(3, int(n ** 0.5) + 1, 2):
		while n % i == 0:
			if i in d:
				d[i] += 1
			else:
				d[i] = 1
			n /= i
	n = int(n)
	if n > 1:
		d[n] = 1
	return d

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // gcd(a, b)

def alphabates():
	return 'abcdefghijklmnopqrstuvwxyz'

def binary_search(ls, n, flag):
	low = 0
	hi = n - 1
	while low <= hi:
		mid = (low + hi) // 2
		if ls[mid] == flag:
			return mid
		elif ls[mid] > flag:
			hi = mid - 1
		else:
			low = mid + 1
	return -1

def qdrt(a, b, c):
	chk = b * b - 4 * a * c
	if chk >= 0:
		ans1 = (-b + chk ** 0.5) / (2 * a)
		ans2 = (-b - chk ** 0.5) / (2 * a)
		return [int(ans1), int(ans2)]
	return -1

def permutation(n, r):
	if n < r:
		return 0
	ans = 1
	for i in range(n - r + 1, n + 1):
		ans *= i
	return ans

def combination(n, r):
	if n < r:
		return 0
	ans = 1
	for i in range(r):
		ans *= n - i
	div = 1
	for i in range(2, r + 1):
		div *= i
	return ans // div

def ispow2(n):
	ans = int(math.log(n, 2))
	if 2 ** ans == n:
		return True
	return False

def _2dmat(n):
	flag = [[i + 1 for i in range(n)]]
	for i in range(2, n + 1):
		new = []
		for j in range((i - 1) * n + 1, i * n + 1):
			new.append(j)
		flag.append(new)
	return flag

def sumn(n):
	return n * (n + 1) // 2

def arrinp():
	return list(map(int, input().split()))

def mult_inp():
	return map(int, input().split())

def main():
	n = int(input())
	k = 0
	for i in range(2 * n, 4 * n, 2):
		if k == n:
			print('\n')
			break
		print(i, end=' ')
		k += 1
	print()
for i in range(int(input())):
	main()


from sys import stdin
input = stdin.readline
for _ in range(int(input())):
	n = int(input())
	a = 4 * n - 2
	for x in range(n):
		print(a, end=' ')
		a -= 2
	print()


for t in range(int(input())):
	n = int(input())
	k = 0
	for i in range(1, n + 1):
		print(n * 2 + k, end=' ')
		k = k + 2
	print()


for i in range(int(input())):
	n = int(input())
	g = []
	c = 4 * n
	for j in range(n):
		g.append(c)
		c = c - 2
	print(' '.join(map(str, g)))


def prime_factors(n):
	i = 2
	factors = []
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.append(i)
	if n > 1:
		factors.append(n)
	return factors
for _ in range(int(input())):
	n = int(input())
	prime = prime_factors(4 * n)[0]
	for i in range(n):
		print(4 * n - prime * i, end=' ')
	print()


import math, collections
for _ in range(int(input())):
	n = int(input())
	seen = collections.defaultdict(bool)
	ans = []
	for i in range(4 * n, 0, -2):
		if not seen[i]:
			ans.append(i)
			for j in range(2, int(math.sqrt(i)) + 1):
				if not i % j:
					seen[j] = True
					seen[i // j] = True
		if len(ans) == n:
			break
	print(*ans)


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	a = []
	for i in range(2 * n, 4 * n, 2):
		a.append(i)
	print(*a)


test_cases = int(input())
array = []
for i in range(test_cases):
	array.append(int(input()))
for i in range(test_cases):
	total = 4 * array[i]
	set = []
	for j in range(array[i]):
		set.append(str(total))
		total -= 2
	print(' '.join(set))


def panda(n):
	l = []
	n1 = 4 * n - 2
	for i in range(n):
		l.append(str(n1))
		n1 -= 2
	return ' '.join(l)
for _ in range(int(input())):
	print(panda(int(input())))


t = int(input())
for j in range(t):
	a = int(input())
	n = 4 * a
	l = []
	while a > 0:
		l.append(n - 2)
		a -= 1
		n = n - 2
	print(*l)


T = int(input())
for z in range(T):
	n = int(input())
	i = 0
	a = 4
	while i < n:
		if a * 2 > 4 * n and a * 4 > 4 * n:
			print(a, end=' ')
			i += 1
		a += 2


t = int(input())
while t:
	n = int(input())
	a = 4 * n
	start = a // 2
	for i in range(n):
		print(start + i * 2, end=' ')
	print('')
	t -= 1


import math
t = int(input())
for _ in range(t):
	n = int(input())
	if n == 1:
		print(1)
	else:
		ans = [str(2 * n)]
		start = 2 * n
		for i in range(n - 1):
			start += 2
			ans.append(str(start))
		print(' '.join(ans))


game = int(input())
for i in range(game):
	n = int(input())
	k = n * 4
	for i in range(n):
		print(k, end=' ')
		k -= 2
	print()


x = int(input())
for i in range(x):
	n = int(input())
	ar = []
	k = 4 * n
	for i in range(0, n):
		ar.append(k)
		k = k - 2
	print(*ar)


import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
from collections import defaultdict
mod = 10 ** 9 + 7
mod1 = 998244353
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class TreeNode:

	def __init__(self, k, v):
		self.key = k
		self.value = v
		self.left = None
		self.right = None
		self.parent = None
		self.height = 1
		self.num_left = 1
		self.num_total = 1

class AvlTree:

	def __init__(self):
		self._tree = None

	def add(self, k, v):
		if not self._tree:
			self._tree = TreeNode(k, v)
			return
		node = self._add(k, v)
		if node:
			self._rebalance(node)

	def _add(self, k, v):
		node = self._tree
		while node:
			if k < node.key:
				if node.left:
					node = node.left
				else:
					node.left = TreeNode(k, v)
					node.left.parent = node
					return node.left
			elif node.key < k:
				if node.right:
					node = node.right
				else:
					node.right = TreeNode(k, v)
					node.right.parent = node
					return node.right
			else:
				node.value = v
				return

	@staticmethod
	def get_height(x):
		return x.height if x else 0

	@staticmethod
	def get_num_total(x):
		return x.num_total if x else 0

	def _rebalance(self, node):
		n = node
		while n:
			lh = self.get_height(n.left)
			rh = self.get_height(n.right)
			n.height = max(lh, rh) + 1
			balance_factor = lh - rh
			n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)
			n.num_left = 1 + self.get_num_total(n.left)
			if balance_factor > 1:
				if self.get_height(n.left.left) < self.get_height(n.left.right):
					self._rotate_left(n.left)
				self._rotate_right(n)
			elif balance_factor < -1:
				if self.get_height(n.right.right) < self.get_height(n.right.left):
					self._rotate_right(n.right)
				self._rotate_left(n)
			else:
				n = n.parent

	def _remove_one(self, node):
		replacement = node.left or node.right
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = replacement
			else:
				node.parent.right = replacement
			replacement.parent = node.parent
			node.parent = None
		else:
			self._tree = replacement
			replacement.parent = None
		node.left = None
		node.right = None
		node.parent = None
		self._rebalance(replacement)

	def _remove_leaf(self, node):
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = None
			else:
				node.parent.right = None
			self._rebalance(node.parent)
		else:
			self._tree = None
		node.parent = None
		node.left = None
		node.right = None

	def remove(self, k):
		node = self._get_node(k)
		if not node:
			return
		if AvlTree._is_leaf(node):
			self._remove_leaf(node)
			return
		if node.left and node.right:
			nxt = AvlTree._get_next(node)
			node.key = nxt.key
			node.value = nxt.value
			if self._is_leaf(nxt):
				self._remove_leaf(nxt)
			else:
				self._remove_one(nxt)
			self._rebalance(node)
		else:
			self._remove_one(node)

	def get(self, k):
		node = self._get_node(k)
		return node.value if node else -1

	def _get_node(self, k):
		if not self._tree:
			return None
		node = self._tree
		while node:
			if k < node.key:
				node = node.left
			elif node.key < k:
				node = node.right
			else:
				return node
		return None

	def get_at(self, pos):
		x = pos + 1
		node = self._tree
		while node:
			if x < node.num_left:
				node = node.left
			elif node.num_left < x:
				x -= node.num_left
				node = node.right
			else:
				return (node.key, node.value)
		raise IndexError('Out of ranges')

	@staticmethod
	def _is_left(node):
		return node.parent.left and node.parent.left == node

	@staticmethod
	def _is_leaf(node):
		return node.left is None and node.right is None

	def _rotate_right(self, node):
		if not node.parent:
			self._tree = node.left
			node.left.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.left
			node.left.parent = node.parent
		else:
			node.parent.right = node.left
			node.left.parent = node.parent
		bk = node.left.right
		node.left.right = node
		node.parent = node.left
		node.left = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	def _rotate_left(self, node):
		if not node.parent:
			self._tree = node.right
			node.right.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.right
			node.right.parent = node.parent
		else:
			node.parent.right = node.right
			node.right.parent = node.parent
		bk = node.right.left
		node.right.left = node
		node.parent = node.right
		node.right = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	@staticmethod
	def _get_next(node):
		if not node.right:
			return node.parent
		n = node.right
		while n.left:
			n = n.left
		return n

class SegmentTree1:

	def __init__(self, data, default=300006, func=lambda a, b: min(a, b)):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: a + b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

def powm(a, n, m):
	if a == 1 or n == 0:
		return 1
	if n % 2 == 0:
		s = powm(a, n // 2, m)
		return s * s % m
	else:
		return a * powm(a, n - 1, m) % m

def sort_list(list1, list2):
	zipped_pairs = zip(list2, list1)
	z = [x for (_, x) in sorted(zipped_pairs)]
	return z

def product(l):
	por = 1
	for i in range(len(l)):
		por *= l[i]
	return por

def binarySearchCount(arr, n, key):
	left = 0
	right = n - 1
	count = 0
	while left <= right:
		mid = int((right + left) / 2)
		if arr[mid] < key:
			count = mid + 1
			left = mid + 1
		else:
			right = mid - 1
	return count

def countdig(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def binary(x, length):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y

def countGreater(arr, n, k):
	l = 0
	r = n - 1
	leftGreater = n
	while l <= r:
		m = int(l + (r - l) / 2)
		if arr[m] > k:
			leftGreater = m
			r = m - 1
		else:
			l = m + 1
	return n - leftGreater

class TrieNode:

	def __init__(self):
		self.children = [None] * 26
		self.isEndOfWord = False

class Trie:

	def __init__(self):
		self.root = self.getNode()

	def getNode(self):
		return TrieNode()

	def _charToIndex(self, ch):
		return ord(ch) - ord('a')

	def insert(self, key):
		pCrawl = self.root
		length = len(key)
		for level in range(length):
			index = self._charToIndex(key[level])
			if not pCrawl.children[index]:
				pCrawl.children[index] = self.getNode()
			pCrawl = pCrawl.children[index]
		pCrawl.isEndOfWord = True

	def search(self, key):
		pCrawl = self.root
		length = len(key)
		for level in range(length):
			index = self._charToIndex(key[level])
			if not pCrawl.children[index]:
				return False
			pCrawl = pCrawl.children[index]
		return pCrawl != None and pCrawl.isEndOfWord

class Node:

	def __init__(self, data):
		self.data = data
		self.count = 0
		self.left = None
		self.right = None

class BinaryTrie:

	def __init__(self):
		self.root = Node(0)

	def insert(self, pre_xor):
		self.temp = self.root
		for i in range(31, -1, -1):
			val = pre_xor & 1 << i
			if val:
				if not self.temp.right:
					self.temp.right = Node(0)
				self.temp = self.temp.right
				self.temp.count += 1
			if not val:
				if not self.temp.left:
					self.temp.left = Node(0)
				self.temp = self.temp.left
				self.temp.count += 1
		self.temp.data = pre_xor

	def query(self, xor):
		self.temp = self.root
		for i in range(31, -1, -1):
			val = xor & 1 << i
			if not val:
				if self.temp.left and self.temp.left.count > 0:
					self.temp = self.temp.left
				elif self.temp.right:
					self.temp = self.temp.right
			elif self.temp.right and self.temp.right.count > 0:
				self.temp = self.temp.right
			elif self.temp.left:
				self.temp = self.temp.left
			self.temp.count -= 1
		return xor ^ self.temp.data
for ik in range(int(input())):
	n = int(input())
	t = 4 * n
	for i in range(n):
		print(t, end=' ')
		t -= 2
	print()


import sys
import math
from functools import reduce
import bisect

def getN():
	return int(input())
for _ in range(getN()):
	n = getN()
	a = n * 4
	for i in range(n):
		print(a, end=' ')
		a -= 2
	print()


import os
import sys
from math import *
from collections import *
from bisect import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
ALPHA = 'abcdefghijklmnopqrstuvwxyz/'
M = 1000000007
EPS = 1e-06

def Ceil(a, b):
	return a // b + int(a % b > 0)

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]
for _ in range(Int()):
	n = Int()
	k = 4 * n
	ans = []
	for i in range(n):
		ans.append(k)
		k -= 2
	print(*ans)


from sys import stdin
from math import *
for __ in range(int(input())):
	n = int(input())
	x = 4 * n
	for i in range(n):
		print(x, end=' ')
		x -= 2
	print()


import sys
from array import array
from typing import List, Tuple, TypeVar, Generic, Sequence, Union

def input():
	return sys.stdin.buffer.readline().decode('utf-8')

def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		print(*range(4 * n, 2 * n, -2))
main()


def do():
	n = int(input())
	if n == 1:
		print(2)
		return
	res = []
	for i in range(4 * n - 2 * (n - 1), 4 * n + 1, 2):
		res.append(i)
	print(' '.join(list(map(str, res))))
q = int(input())
for _ in range(q):
	do()


import sys, math
from collections import deque, defaultdict
import operator as op
from functools import reduce
I = sys.stdin.readline

def ii():
	return int(I().strip())

def li():
	return list(map(int, I().strip().split()))

def mi():
	return map(int, I().strip().split())

def ncr(n, r):
	r = min(r, n - r)
	numer = reduce(op.mul, range(n, n - r, -1), 1)
	denom = reduce(op.mul, range(1, r + 1), 1)
	return numer // denom

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

def valid(row, col, rows, cols, rcross, lcross):
	return rows[row] == 0 and cols[col] == 0 and (rcross[col + row] == 0) and (lcross[col - row] == 0)

def main():
	for _ in range(ii()):
		n = ii()
		ans = [4 * n]
		x = 4 * n - 2
		while len(ans) != n:
			f = 1
			for i in range(len(ans) - 1, -1, -1):
				if x % ans[i] == 0:
					f = 0
					break
			if f:
				ans.append(x)
			x -= 2
		print(*ans)
main()


n = int(input())
for i in range(n):
	a = int(input())
	rs = ''
	b = 4 * a
	for i in range(a):
		b -= 2
		rs += str(b)
		rs += ' '
	print(rs)


from math import gcd
from sys import maxsize, stdout, stdin, stderr
import re
tup = lambda : map(int, stdin.readline().split())
I = lambda : int(stdin.readline())
lint = lambda : [int(x) for x in stdin.readline().split()]
S = lambda : stdin.readline().replace('\n', '').strip()

def grid(r, c):
	return [lint() for i in range(r)]

def debug(*args, c=6):
	print('\x1b[3{}m'.format(c), *args, '\x1b[0m', file=stderr)
stpr = lambda x: stdout.write(f'{x}' + '\n')
star = lambda x: print(' '.join(map(str, x)))
for _ in range(I()):
	n = I()
	arr = []
	c = 4 * n - 2
	for i in range(n):
		arr.append(c)
		c -= 2
	print(*arr)


t = int(input())
for i in range(t):
	n = int(input())
	l = []
	if n == 1:
		print(n)
	else:
		a = 2 * n + 2
		b = 4 * n + 1
		for k in range(a, b):
			if k % 2 == 0:
				l.append(k)
	if n != 1:
		print(*l)


for i in range(int(input())):
	n = int(input())
	ans = 4 * n
	for x in range(n):
		if x == n - 1:
			print(ans)
		else:
			print(ans, end=' ')
			ans -= 2


def check(a, b):
	for k in range(len(a)):
		if b % a[k] == 0:
			return 1
	if b % 2 == 0:
		return 0
for i in range(int(input())):
	n = int(input())
	c = [2 * n]
	if n == 2:
		print(4, 6)
	elif n == 3:
		print(4, 6, 10)
	else:
		while True:
			for i in range(c[-1], 4 * n + 1):
				if check(c, i) == 0:
					c.append(i)
					if len(c) == n:
						break
				else:
					continue
			break
		print(*c)


testcases = int(input())
for i in range(testcases):
	n = int(input())
	k = 2 * n
	for j in range(n):
		print(k, end=' ')
		k += 2
	print()


for t in range(int(input())):
	n = int(input())
	print(*range(4 * n, 2 * n, -2))


for ct in range(int(input())):
	n = int(input())
	print(*[i for i in range(2 * n, 4 * n, 2)])


t = int(input())
for i in range(t):
	n = int(input())
	l = [str(2 * v) for v in range(n, 2 * n)]
	print(' '.join(l))


for _ in ' ' * int(input()):
	n = int(input())
	c = 0
	for x in range(n * 4, 0, -2):
		print(x, end=' ')
		c += 1
		if c == n:
			break


def kids_seating():
	t = int(input())
	for _ in range(t):
		n = int(input())
		arr = [0] * 1000
		output = []
		for x in range(4 * n, 0, -2):
			if arr[x * 2] == 0:
				output += [x]
			arr[x] = 1
		print(*output)
kids_seating()


import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
mod = 10 ** 9 + 7

def lcm(x, y):
	return x * y / gcd(x, y)

def fact(x, mod=mod):
	ans = 1
	for i in range(1, x + 1):
		ans = ans * i % mod
	return ans

def arr2D(n, m, default=0):
	return [[default for j in range(m)] for i in range(n)]

def arr3D(n, m, r, default=0):
	return [[[default for k in range(r)] for j in range(m)] for i in range(n)]

def sortDictV(x):
	return {k: v for (k, v) in sorted(x.items(), key=lambda item: item[1])}

class DSU:

	def __init__(self, length):
		self.length = length
		self.parent = [-1] * self.length

	def getParent(self, node, start):
		if node >= self.length:
			return False
		if self.parent[node] < 0:
			if start != node:
				self.parent[start] = node
			return node
		return self.getParent(self.parent[node], start)

	def union(self, node1, node2):
		parent1 = self.getParent(node1, node1)
		parent2 = self.getParent(node2, node2)
		if parent1 == parent2:
			return False
		elif self.parent[parent1] <= self.parent[parent2]:
			self.parent[parent1] += self.parent[parent2]
			self.parent[parent2] = parent1
		else:
			self.parent[parent2] += self.parent[parent1]
			self.parent[parent1] = parent2
		return True

	def getCount(self, node):
		return -self.parent[self.getParent(node, node)]
from math import gcd

def solve(n):
	if n == 1:
		print(2)
		return
	lst = [4 * n]
	for i in range(4 * n, 0, -1):
		f = False
		for j in lst:
			if j % i == 0 or i % j == 0 or gcd(i, j) == 1:
				f = True
		if not f:
			lst.append(i)
		if len(lst) == n:
			break
	for i in lst:
		print(i, end=' ')
for _ in range(int(input())):
	n = int(input())
	solve(n)
	print()


import math
for t in range(int(input())):
	n = int(input())
	ans = [4 * n - 2]
	for i in range(4 * n, 1, -1):
		no = i
		poss = 0
		for j in range(len(ans)):
			val = ans[j]
			if val % no == 0 or no % val == 0 or math.gcd(val, no) == 1:
				poss += 1
				break
		if poss == 0:
			ans.append(i)
	print(*ans)


t = int(input())
for i in range(t):
	n = int(input())
	mx = 4 * n
	ans = [0] * n
	curMax = mx - 2
	for k in range(n):
		ans[k] = curMax
		curMax -= 2
	print(*ans)


import sys
input = sys.stdin.readline
from collections import defaultdict
for _ in range(int(input())):
	n = int(input())
	x = 4 * n
	for i in range(n):
		print(x, end=' ')
		x -= 2
	print()


import sys
input = sys.stdin.readline

def prog():
	for _ in range(int(input())):
		n = int(input())
		output = []
		for i in range(2 * n, 4 * n, 2):
			output.append(i)
		print(*output)
prog()


t = int(input())
for i in range(t):
	n = int(input())
	if n == 1:
		print(n, end=' ')
	c = 0
	for i in range(4 * n - 1, 2, -1):
		if c == n:
			break
		if i % 2 == 0:
			print(i, end=' ')
			c += 1
	print()


t = int(input())
while t > 0:
	t -= 1
	n = int(input())
	start = n * 2
	f = False
	pnts = 0
	while pnts != n:
		print(start, end=' ')
		pnts += 1
		start += 2
	print('')


t = int(input())
for _ in range(t):
	n = int(input())
	a = ''
	for i in range(n):
		a = a + str(2 * (n + i)) + ' '
	print(a)


t = int(input())
for i in range(t):
	r = []
	r1 = []
	n = int(input())
	a = 4 * n
	for _ in range(a, 2, -2):
		r.append(_)
	for j in range(n):
		r1.append(r[j])
	for l in r1:
		print(l, end=' ')
	print()


import sys
for _ in range(int(sys.stdin.readline())):
	a = int(sys.stdin.readline())
	i = a - 1
	b = []
	while i > -1:
		b.append(4 * a - 2 * i)
		i -= 1
	print(' '.join(list(map(str, b))))


import sys
tests = int(sys.stdin.readline())
for _ in range(tests):
	n = int(sys.stdin.readline())
	start = n * 2
	for i in range(n):
		print(start, end=' ')
		start += 2
	print()


import sys, os
from math import sqrt, gcd, ceil, log, floor
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda : list(map(int, input().strip().split()))
MOD = 10 ** 9 + 7

def main():
	for _ in range(int(input())):
		n = int(input())
		for i in range(4 * n, 2 * n, -2):
			print(i, end=' ')
		print('', end='\n')
main()


for _ in range(int(input())):
	n = int(input())
	c = 0
	num = []
	for i in range(4 * n, 0, -2):
		if c != n:
			num.append(i)
			c += 1
	print(*num)


T = int(input())
for t in range(T):
	n = int(input())
	arr = []
	num = 4 * n
	for i in range(n):
		arr.append(num)
		num -= 2
	print(' '.join([str(j) for j in arr]))


import math
import sys
input = sys.stdin.readline

def solve():
	n = int(input())
	print(' '.join([str(4 * n - 2 * i) for i in range(1, n + 1)]))
	return None
for t in range(int(input())):
	solve()


p = [4, 6, 10, 14, 22, 26, 34, 38, 46, 58, 62, 74, 82, 86, 94, 106, 118, 122, 134, 142, 146, 158, 166, 178, 194, 202, 206, 214, 218, 226, 254, 262, 274, 278, 298, 302, 314, 326, 334, 346, 358, 362, 382, 386, 394, 398, 422, 446, 454, 458, 466, 478, 482, 502, 514, 526, 538, 542, 554, 562, 566, 586, 614, 622, 626, 634, 662, 674, 694, 698, 706, 718, 734, 746, 758, 766, 778, 794, 802, 818, 838, 842, 862, 866, 878, 886, 898, 914, 922, 926, 934, 958, 974, 982, 998, 1006, 1018, 1042, 1046, 1082, 1094, 1114, 1126, 1138, 1142, 1154, 1174, 1186, 1198, 1202, 1214, 1226, 1234, 1238, 1262, 1282, 1286, 1294, 1306, 1318, 1322, 1346, 1354, 1366, 1382, 1402, 1418, 1438, 1454, 1466, 1478, 1486, 1502, 1514, 1522, 1538, 1546, 1574, 1594, 1618, 1622, 1642, 1646, 1654, 1658, 1678, 1706, 1714, 1718, 1726, 1754, 1762, 1766, 1774, 1814, 1822, 1838, 1858, 1874, 1882, 1894, 1906, 1934, 1942, 1954, 1966, 1982, 1994]
for i in range(int(input())):
	l = []
	n = int(input())
	for i in range(n + 1, 4 * n + 1):
		if i not in l:
			l.append(i * 2)
	print(*l[:n])


for _ in range(int(input())):
	n = int(input())
	x = []
	for i in range(2, 4 * n, 2):
		if len(x) < n:
			x.append(4 * n - i)
		else:
			break
	for j in range(n):
		print(x[j], end=' ')
	print()


T = int(input())

def f(a):
	if a % 2 == 0:
		return True
	else:
		return False
while T != 0:
	n = int(input())
	v = list(range(1, 4 * n + 1))
	for i in list(filter(f, v))[-n:]:
		print(i, end=' ')
	T -= 1


def find(n):
	li = []
	for i in range(2 * n, 400, 2):
		is_true = True
		for j in li:
			if i % j == 0:
				is_true = False
				break
		if is_true:
			li.append(i)
	return li[:n]
for _ in range(int(input())):
	ans = find(int(input()))
	for i in ans:
		print(i, sep=' ', end=' ')
	print()


t_n = int(input())
for i_t in range(t_n):
	n = int(input())
	print(*[4 * n - 2 * x for x in range(n)])


for i in range(int(input())):
	n = int(input())
	m = []
	count = 0
	for i in range(2 * n + 2, 4 * n + 1, 2):
		m.append(i)
		if len(m) == n:
			break
	print(' '.join(map(str, m)))


T = int(input())
while T:
	n = int(input())
	x = n * 2
	for i in range(n):
		print(x, end=' ')
		x += 2
	print()
	T -= 1


import math as m

def solve():
	n = int(input())
	if n == 1:
		print(4)
	else:
		l = []
		a = 4 * n
		while len(l) < n:
			flag = 1
			for i in l:
				if a % i == 0 or m.gcd(a, i) == 1:
					flag = 0
					break
			if flag == 1:
				l.append(a)
			a -= 1
		print(*l)
for _ in range(int(input())):
	solve()


import sys
from collections import deque, defaultdict, namedtuple
import heapq
from math import sqrt, factorial, gcd, ceil, atan, pi
from itertools import permutations

def input():
	return sys.stdin.buffer.readline().decode('utf-8').strip()
import string
import operator
import random
from bisect import bisect_left, bisect_right
from functools import lru_cache, reduce
MOD = int(1000000000.0) + 7
INF = float('inf')

def solve():
	n = int(input())
	ans = set()
	for i in range(4 * n, 3, -1):
		bad = 0
		for e in ans:
			if gcd(e, i) in [e, i, 1]:
				bad = 1
		if not bad:
			ans.add(i)
	print(*ans)
T = 1
T = int(input())
for case in range(1, T + 1):
	ans = solve()


import sys
from math import gcd, sqrt, ceil, log2
from collections import defaultdict, Counter, deque
from bisect import bisect_left, bisect_right
import math
sys.setrecursionlimit(2 * 10 ** 5 + 10)
import heapq
from itertools import permutations
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
aa = 'abcdefghijklmnopqrstuvwxyz'

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def get_sum(bit, i):
	s = 0
	i += 1
	while i > 0:
		s += bit[i]
		i -= i & -i
	return s

def update(bit, n, i, v):
	i += 1
	while i <= n:
		bit[i] += v
		i += i & -i

def modInverse(b, m):
	g = math.gcd(b, m)
	if g != 1:
		return -1
	else:
		return pow(b, m - 2, m)

def primeFactors(n):
	sa = []
	while n % 2 == 0:
		sa.append(2)
		n = n // 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			sa.append(i)
			n = n // i
	if n > 2:
		sa.append(n)
	return sa

def seive(n):
	pri = [True] * (n + 1)
	p = 2
	while p * p <= n:
		if pri[p] == True:
			for i in range(p * p, n + 1, p):
				pri[i] = False
		p += 1
	return pri

def check_prim(n):
	if n < 0:
		return False
	for i in range(2, int(sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True

def getZarr(string, z):
	n = len(string)
	(l, r, k) = (0, 0, 0)
	for i in range(1, n):
		if i > r:
			(l, r) = (i, i)
			while r < n and string[r - l] == string[r]:
				r += 1
			z[i] = r - l
			r -= 1
		else:
			k = i - l
			if z[k] < r - i + 1:
				z[i] = z[k]
			else:
				l = i
				while r < n and string[r - l] == string[r]:
					r += 1
				z[i] = r - l
				r -= 1

def search(text, pattern):
	concat = pattern + '$' + text
	l = len(concat)
	z = [0] * l
	getZarr(concat, z)
	ha = []
	for i in range(l):
		if z[i] == len(pattern):
			ha.append(i - len(pattern) - 1)
	return ha

def mergeIntervals(arr):
	arr.sort(key=lambda x: x[0])
	m = []
	s = -10000
	max = -100000
	for i in range(len(arr)):
		a = arr[i]
		if a[0] > max:
			if i != 0:
				m.append([s, max])
			max = a[1]
			s = a[0]
		elif a[1] >= max:
			max = a[1]
	if max != -100000 and [s, max] not in m:
		m.append([s, max])
	return m

class SortedList:

	def __init__(self, iterable=[], _load=200):
		values = sorted(iterable)
		self._len = _len = len(values)
		self._load = _load
		self._lists = _lists = [values[i:i + _load] for i in range(0, _len, _load)]
		self._list_lens = [len(_list) for _list in _lists]
		self._mins = [_list[0] for _list in _lists]
		self._fen_tree = []
		self._rebuild = True

	def _fen_build(self):
		self._fen_tree[:] = self._list_lens
		_fen_tree = self._fen_tree
		for i in range(len(_fen_tree)):
			if i | i + 1 < len(_fen_tree):
				_fen_tree[i | i + 1] += _fen_tree[i]
		self._rebuild = False

	def _fen_update(self, index, value):
		if not self._rebuild:
			_fen_tree = self._fen_tree
			while index < len(_fen_tree):
				_fen_tree[index] += value
				index |= index + 1

	def _fen_query(self, end):
		if self._rebuild:
			self._fen_build()
		_fen_tree = self._fen_tree
		x = 0
		while end:
			x += _fen_tree[end - 1]
			end &= end - 1
		return x

	def _fen_findkth(self, k):
		_list_lens = self._list_lens
		if k < _list_lens[0]:
			return (0, k)
		if k >= self._len - _list_lens[-1]:
			return (len(_list_lens) - 1, k + _list_lens[-1] - self._len)
		if self._rebuild:
			self._fen_build()
		_fen_tree = self._fen_tree
		idx = -1
		for d in reversed(range(len(_fen_tree).bit_length())):
			right_idx = idx + (1 << d)
			if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:
				idx = right_idx
				k -= _fen_tree[idx]
		return (idx + 1, k)

	def _delete(self, pos, idx):
		_lists = self._lists
		_mins = self._mins
		_list_lens = self._list_lens
		self._len -= 1
		self._fen_update(pos, -1)
		del _lists[pos][idx]
		_list_lens[pos] -= 1
		if _list_lens[pos]:
			_mins[pos] = _lists[pos][0]
		else:
			del _lists[pos]
			del _list_lens[pos]
			del _mins[pos]
			self._rebuild = True

	def _loc_left(self, value):
		if not self._len:
			return (0, 0)
		_lists = self._lists
		_mins = self._mins
		(lo, pos) = (-1, len(_lists) - 1)
		while lo + 1 < pos:
			mi = lo + pos >> 1
			if value <= _mins[mi]:
				pos = mi
			else:
				lo = mi
		if pos and value <= _lists[pos - 1][-1]:
			pos -= 1
		_list = _lists[pos]
		(lo, idx) = (-1, len(_list))
		while lo + 1 < idx:
			mi = lo + idx >> 1
			if value <= _list[mi]:
				idx = mi
			else:
				lo = mi
		return (pos, idx)

	def _loc_right(self, value):
		if not self._len:
			return (0, 0)
		_lists = self._lists
		_mins = self._mins
		(pos, hi) = (0, len(_lists))
		while pos + 1 < hi:
			mi = pos + hi >> 1
			if value < _mins[mi]:
				hi = mi
			else:
				pos = mi
		_list = _lists[pos]
		(lo, idx) = (-1, len(_list))
		while lo + 1 < idx:
			mi = lo + idx >> 1
			if value < _list[mi]:
				idx = mi
			else:
				lo = mi
		return (pos, idx)

	def add(self, value):
		_load = self._load
		_lists = self._lists
		_mins = self._mins
		_list_lens = self._list_lens
		self._len += 1
		if _lists:
			(pos, idx) = self._loc_right(value)
			self._fen_update(pos, 1)
			_list = _lists[pos]
			_list.insert(idx, value)
			_list_lens[pos] += 1
			_mins[pos] = _list[0]
			if _load + _load < len(_list):
				_lists.insert(pos + 1, _list[_load:])
				_list_lens.insert(pos + 1, len(_list) - _load)
				_mins.insert(pos + 1, _list[_load])
				_list_lens[pos] = _load
				del _list[_load:]
				self._rebuild = True
		else:
			_lists.append([value])
			_mins.append(value)
			_list_lens.append(1)
			self._rebuild = True

	def discard(self, value):
		_lists = self._lists
		if _lists:
			(pos, idx) = self._loc_right(value)
			if idx and _lists[pos][idx - 1] == value:
				self._delete(pos, idx - 1)

	def remove(self, value):
		_len = self._len
		self.discard(value)
		if _len == self._len:
			raise ValueError('{0!r} not in list'.format(value))

	def pop(self, index=-1):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		value = self._lists[pos][idx]
		self._delete(pos, idx)
		return value

	def bisect_left(self, value):
		(pos, idx) = self._loc_left(value)
		return self._fen_query(pos) + idx

	def bisect_right(self, value):
		(pos, idx) = self._loc_right(value)
		return self._fen_query(pos) + idx

	def count(self, value):
		return self.bisect_right(value) - self.bisect_left(value)

	def __len__(self):
		return self._len

	def __getitem__(self, index):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		return self._lists[pos][idx]

	def __delitem__(self, index):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		self._delete(pos, idx)

	def __contains__(self, value):
		_lists = self._lists
		if _lists:
			(pos, idx) = self._loc_left(value)
			return idx < len(_lists[pos]) and _lists[pos][idx] == value
		return False

	def __iter__(self):
		return (value for _list in self._lists for value in _list)

	def __reversed__(self):
		return (value for _list in reversed(self._lists) for value in reversed(_list))

	def __repr__(self):
		return 'SortedList({0})'.format(list(self))

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p

def sol(n):
	seti = set()
	for i in range(1, int(sqrt(n)) + 1):
		if n % i == 0:
			seti.add(n // i)
			seti.add(i)
	return seti

def lcm(a, b):
	return a * b // gcd(a, b)
t = int(input())
for _ in range(t):
	n = int(input())
	temp = 4
	ans = []
	while len(ans) != n:
		ans = [temp]
		for i in range(temp + 1, 4 * n + 1):
			if len(ans) == n:
				break
			flag = 0
			for j in ans:
				if gcd(j, i) == 1 or j % i == 0 or i % j == 0:
					flag = 1
					break
			if not flag:
				ans.append(i)
		temp += 1
	print(*ans)


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from functools import cmp_to_key
from heapq import *
from math import gcd, factorial, floor, ceil, sqrt
from copy import deepcopy
from collections import deque
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
				continue
			stack.pop()
			if not stack:
				break
			to = stack[-1].send(to)
		return to
	return wrapped_func

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for pp in range(t):
		solve(pp)

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def google(p):
	print('Case #' + str(p) + ': ', end='')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(x, y, p):
	y %= p - 1
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True
inf = pow(10, 20)
mod = 10 ** 9 + 7

def solve(case):
	n = int(inp())
	val = 4 * n
	for i in range(n):
		print(val, end=' ')
		val -= 2
	print()
testcase(int(inp()))


def isPrime(n):
	if n == 1:
		return False
	for i in range(2, n // 2 + 1):
		if n % i == 0:
			return False
	return True
T = int(input())
for t in range(T):
	n = int(input())
	res = [4 * n - 2 * i for i in range(1, n + 1)]
	print(*res)


a = int(input())
for x in range(a):
	b = int(input())
	c = b * 2 - 1
	for x in range(b, c + 1):
		print(2 * x, end=' ')
	print()


t = int(input())
while t:
	n = int(input())
	l = []
	range = 4 * n
	range -= 2
	while n:
		print(range, end=' ')
		range -= 2
		n -= 1
	print()
	t -= 1


t = int(input())
for i in range(t):
	x = int(input())
	for j in range(x):
		print(x * 2 + 2 + j * 2, end=' ')
	print()


from sys import stdin, stdout
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	i = 4 * n
	k = 0
	while k != n:
		print(i - 2, end=' ')
		k += 1
		i = i - 2
	print('')


def solve(n):
	l = []
	f = 0
	m = 4 * n
	for j in range(n):
		if f == 0:
			m -= 2
			l.append(m)
			f = 1
		else:
			m -= 2
			l.append(m)
			f = 0
	return l
for _ in range(int(input())):
	n = int(input())
	l = solve(n)
	for i in l:
		print(i, end=' ')
	print()


import sys
try:
	(sys.stdin, sys.stdout) = (open('in.txt', 'r'), open('out.txt', 'w'))
except:
	pass
ii1 = lambda : int(sys.stdin.readline().strip())
is1 = lambda : sys.stdin.readline().strip()
iia = lambda : list(map(int, sys.stdin.readline().strip().split()))
isa = lambda : sys.stdin.readline().strip().split()
mod = int(1000000000.0 + 7)
from collections import *
from math import *
for _ in range(ii1()):
	n = ii1()
	first = n * 2
	for i in range(n):
		print(first, end=' ')
		first += 2
	print()


t = int(input())
for i in range(t):
	n = int(input())
	for j in range(2 * n + 2, 4 * n + 1):
		if j % 2 == 0:
			if j < 4 * n:
				print(j, end=' ')
			else:
				print(j)


t = int(input())
for _ in range(t):
	n = int(input())
	print(' '.join((str(i) for i in list(range(4 * n, 2 * n + 1, -2)))))


import sys
import math
from functools import reduce
import bisect

def getN():
	return int(input())

def getNM():
	return map(int, input().split())

def getList():
	return list(map(int, input().split()))

def input():
	return sys.stdin.readline().rstrip()

def index(a, x):
	i = bisect.bisect_left(a, x)
	if i != len(a) and a[i] == x:
		return i
	return False
for _ in range(getN()):
	n = getN()
	a = n * 4
	for i in range(n):
		print(a, end=' ')
		a -= 2
	print()


t = int(input())
for i in range(t):
	result = []
	n = int(input())
	for j in range(4 * n, 4 * n - (n - 1) * 2 - 2, -2):
		result.append(str(j))
	print(' '.join(result))


import sys
input = sys.stdin.buffer.readline
t = int(input())
for _ in range(t):
	n = int(input())
	print(*range(2 * n + 2, 4 * n + 1, 2))


for u in range(int(input())):
	n = int(input())
	x = 4 * n
	l = []
	for i in range(n):
		l.append(x)
		x -= 2
	print(*l)


for _ in range(int(input())):
	n = int(input())
	for x in range(n, 2 * n):
		print(x * 2, end=' ')
	print()


import sys
input = sys.stdin.readline

def inp():
	return int(input())

def inara():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
t = inp()
for _ in range(t):
	n = inp()
	a = []
	start = n
	for i in range(4 * n, 1, -2):
		if len(a) == n:
			break
		flag = True
		for num in a:
			if num % i == 0:
				flag = False
				break
		if flag:
			a.append(i)
	assert len(a) == n
	print(*a)


import math

def dtb(n):
	return bin(n).replace('0b', '')

def btd(n):
	return int(n, 2)
t = int(input())
for k in range(t):
	n = int(input())
	x = 4 * n
	for i in range(n):
		print(x, end=' ')
		x -= 2
	print()


t = int(input())
for _ in range(t):
	n = int(input())
	print(*list(range(n * 4, n * 4 - n * 2, -2)))


t = int(input())

def solve(n):
	sol = []
	(i, j) = (4 * n, 0)
	while i > 0 and j < n:
		sol.append(i)
		i -= 2
		j += 1
	return sol
for i in range(t):
	print(' '.join([str(x) for x in solve(int(input()))]))


import os
import sys
from io import BytesIO, IOBase
import math
from itertools import permutations
from decimal import Decimal, getcontext
getcontext().prec = 25
MOD = pow(10, 9) + 7
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from collections import deque
for _ in range(int(input())):
	n = int(input())
	a = []
	for i in range(n):
		a.append(4 * n - (i + 1) * 2)
	print(*a)


n = int(input())
for _ in range(n):
	k = int(input())
	w = k * 4
	for i in range(k):
		r = w - 2 * i
		print(r, end=' ')
	print()


kol = int(input())
for i in range(kol):
	s = []
	k = int(input())
	stul = k * 4
	fl = 0
	for t in range(stul):
		if fl == k:
			break
		elif (stul - t) % 2 == 0:
			s.append(stul - t)
			fl = fl + 1
	print(*s, sep=' ')


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from math import gcd, ceil

def prod(a, mod=10 ** 9 + 7):
	ans = 1
	for each in a:
		ans = ans * each % mod
	return ans

def lcm(a, b):
	return a * b // gcd(a, b)

def binary(x, length=16):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y
for _ in range(int(input()) if True else 1):
	n = int(input())
	print(*[i for i in range(2 * n, 4 * n, 2)])


from sys import stdin, stdout, setrecursionlimit
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm, accumulate
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
import copy
import time
setrecursionlimit(10 ** 9)
starttime = time.time()
mod = int(pow(10, 9) + 7)
mod2 = 998244353

def data():
	return input()

def num():
	return int(input())

def L():
	return list(sp())

def LF():
	return list(spf())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def spf():
	return map(int, input.readline().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]

def pmat(A):
	for ele in A:
		print(*ele, end='\n')

def pmat2(A):
	for ele in A:
		for j in ele:
			print(j, end='')
		print()

def iseven(n):
	return n % 2 == 0

def seive(r):
	prime = [1 for i in range(r + 1)]
	prime[0] = 0
	prime[1] = 0
	for i in range(r + 1):
		if prime[i]:
			for j in range(2 * i, r + 1, i):
				prime[j] = 0
	return prime
for _ in range(int(input())):
	n = int(data())
	ans = [4 * n - 2]
	d = 0
	for i in range(4 * n - 4, 3, -2):
		for j in ans:
			if gcd(i, j) > 1 and j % i != 0:
				d += 1
		if d == len(ans):
			ans.append(i)
		d = 0
	print(*ans[:n])
endtime = time.time()