#include <bits/stdc++.h>
using namespace std;

void solve() {
    int n;
    cin >> n;
    if (n >= 4) {
        cout << "impossible\n";
    } else if (n == 1) {
        cout << "1 1 1 2\n";
    } else if (n == 2) {
        cout << "1 1 1 2\n";
        cout << "1 3 1 4\n";
        cout << "1 5 1 6\n";
    } else {
        cout << "1 1 1 2\n";
        cout << "1 3 2 3\n";
        cout << "1 4 2 4\n";
        cout << "2 1 2 2\n";
        cout << "3 3 3 4\n";
        cout << "2 5 3 5\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}

/*

Constructive:

有 [n * (n + 1) / 2] 个多米诺骨牌:
(1, 1), (1, 2) .. (1, n)
        (2, 2) .. (2, n)
..
                  (n, n)

求放置方案, 使得多米诺骨牌上的所有相同的数字都相邻

*/