#include <bits/stdc++.h>
#define MAXN 100005
#define For(I,A,B) for(int I = (A), endi = (B); I <= endi; ++I)
#define foR(I,A,B) for(int I = (A), endi = (B); I >= endi; --I)
#define ForE(I,A) for(int I = head[A]; I; I = e[I].nxt)
using namespace std;
typedef long long _ll;
typedef unsigned int ui;

int T,n;
void solve()
{
    cin >> n;
    if(n == 1) cout << "1 1 1 2\n";
    if(n == 2) cout << "1 1 1 2\n1 3 1 4\n1 5 1 6\n";
    if(n == 3) cout << "2 1 2 2\n2 3 2 4\n3 3 3 4\n1 4 1 5\n2 5 2 6\n3 5 3 6\n";
    if(n == 4) cout << "1 1 1 2\n1 3 2 3\n1 4 1 5\n2 1 3 1\n2 2 3 2\n2 4 3 4\n3 3 4 3\n2 5 3 5\n4 5 4 4\n4 1 4 2\n";
    if(n > 4) cout << "impossible\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> T;
    while(T--) solve();
    return 0;
}