------
## 最终结论
```python
def find_chairs(n):
    # Choose numbers that are all even, so gcd(a, b) > 1 and none divides the other
    return [2 * i for i in range(1, n + 1)]

def main():
    import sys
    input = sys.stdin.read
    data = input().strip().split()
    
    t = int(data[0])
    results = []
    
    for i in range(t):
        n = int(data[i + 1])
        result = find_chairs(n)
        results.append(" ".join(map(str, result)))
    
    for result in results:
        print(result)

if __name__ == "__main__":
    main()
```