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

Difficulty: interview

Starter code:

Solutions:
t=int(input())
for you in range(t):
    n=int(input())
    for i in range(n):
        print(4*n-2*i,end=" ")
    print()


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


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()




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

import sys,math
# import re
# from heapq import *
# from collections import defaultdict as dd
# from collections import Counter as cc
# sys.setrecursionlimit(10**6)#thsis is must
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()

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)
    


import sys
import math
import itertools
import functools
import collections
import operator
import fileinput
import copy
import string


ORDA = 97  # a
def ii(): return int(input())
def mi(): return list(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)])


a = int(input())
for i in range (a):
    b = int(input())
    for j in range (2 * b + 2, 4 * b, 2):
        print(j, end = " ")
    print(4 * b)

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()

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
import sys


def chek(m, b, c, li):
    for i in range(li):
        if m[i] + b[i] > c:
            return False
    return True


# 113759
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()

import sys
input=sys.stdin.readline

T=int(input())
for _ in range(T):
    #N,K=map(int,input().split())
    #A=list(map(int,input().split()))
    n=int(input())
    v=4*n
    for i in range(n):
        print(v,end=" ")
        v=v-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))) 

# map(int, input().split())
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()