#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
// #define ATC
#define LL long long
#define eb emplace_back
#define writesp(x) write(x), putchar(' ')
#define writeln(x) write(x), putchar('\n')
#define FIO(FILENAME) freopen(FILENAME".in", "r", stdin), freopen(FILENAME".out", "w", stdout)
using namespace std;

#ifdef ATC
#include <atcoder/all>
using namespace atcoder;
#endif

namespace IO {
	char ibuf[(1 << 20) + 1], *iS, *iT;
#if ONLINE_JUDGE
#define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, (1 << 20) + 1, stdin), (iS == iT ? EOF : *iS++) : *iS++)
#else
#define gh() getchar()
#endif
	inline long long read() {
		char ch = gh();
		long long x = 0;
		bool t = 0;
		while (ch < '0' || ch > '9') t |= ch == '-', ch = gh();
		while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
		return t ? ~(x - 1) : x;
	}
	template<typename _Tp>
	inline void write(_Tp x) {
		static char stk[64], *top = stk;
		if (x < 0) {
			x = ~(x - 1);
			putchar('-');
		}
		do *top++ = x % 10, x /= 10;
		while (x);
		while (top != stk) putchar((*--top) | 48);
	}
}

using IO::read;
using IO::write;

using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define MP make_pair

constexpr int N = 1 << 7, M = 12, mod = 1e9 + 7, B = 5;
int T, fac[N], ifac[N], inv[N];
bitset<mod> s;
vector<pii> q;
vi as[M];

inline int ksm (int b, int k) {
	int r = 1;
	for (; k; k >>= 1, b = (LL)b * b % mod) if (k & 1) r = (LL)r * b % mod;
	return r;
}

inline int Binom (int i, int j) {
	if (i < j || i < 0 || j < 0) return 0;
	return (LL)fac[i] * ifac[j] % mod * ifac[i - j] % mod;
}

void init () {
	fac[0] = 1;
	for (int i = 1; i < N; i++) fac[i] = (LL)fac[i - 1] * i % mod;
	ifac[N - 1] = ksm(fac[N - 1], mod - 2);
	for (int i = N - 2; ~i; i--) ifac[i] = (LL)ifac[i + 1] * (i + 1) % mod;
    for (int i = 1; i < N; i++) inv[i] = (LL)ifac[i] * fac[i - 1] % mod;
}

int v[N], iv[N], stk[N];
vi L, R;

bool fl;
int Goal;
vi P;

inline void dfsL (int d, int l, int u, int ml) {
	if (!u) {
        if (fl) {
            if (ml == Goal) {
                for (int i = 0; i < d; i++) P.eb(stk[i]);
            }
            return;
        }
		L.eb(ml);
		return;
	}
	for (int i = 1; i <= min(l, u); i++) {
		stk[d] = i;
		dfsL(d + 1, i, u - i, (LL)ml * iv[i] % mod);
	}
}

inline void dfsR (int d, int l, int u, int ml) {
	if (!u) {
        if (fl) {
            if (ml == Goal) {
                for (int i = 0; i < d; i++) P.eb(stk[i]);
            }
            return;
        }
		R.eb(ml);
		return;
	}
	for (int i = l; i <= u; i++) {
		stk[d] = i;
		dfsR(d + 1, i, u - i, (LL)ml * v[i] % mod);
	}
}

inline void BF (int n) {
    if (q.empty()) return;
	int o = n * (n - 1);
    o = ksm(o, mod - 2);
	for (int i = 1; i < n - 1; i++) {
        v[i] = (LL)fac[n - 2] * ifac[n - 2 - i] % mod;
        iv[i] = (LL)ifac[n - 2] * fac[n - 2 - i] % mod;
    }
	for (int i = 0; i < n - 1; i++) {
        if (q.empty()) return;
		vi().swap(L), vi().swap(R);
		dfsL(0, B, i, 1);
		dfsR(0, B + 1, n - 2 - i, 1);
        // cout << n << ' ' << i << ' ' << L.size() << ' ' << R.size() << '\n';
        for (int j : R) s.set(j);
		for (int j : L) {
			for (int k = 0; k < q.size(); k++) {
				auto [goal, id] = q[k];
				goal = (LL)goal * o % mod * j % mod;
				if (!s.test(goal)) continue;
                fl = 1;
                vi().swap(P);
                Goal = j;
                dfsL(0, B, i, 1);
                as[id].insert(as[id].end(), P.begin(), P.end());
                vi().swap(P);
                Goal = goal;
                dfsR(0, B + 1, n - 2 - i, 1);
                fl = 0;
                as[id].insert(as[id].end(), P.begin(), P.end());
				as[id].resize(n);
				q.erase(q.begin() + k);
				--k;
			}
		}
        for (int j : R) s.set(j, 0);
	}
}

inline void __out (vector<int> v) {
    cout << v.size() << '\n';
    sort(v.begin(), v.end(), greater<>());
    ++v[0];
    int s = 1;
    for (int i = 0; i < v.size(); i++) {
        for (int j = s; j < s + v[i]; j++) {
            cout << (i + 1) << ' ' << (j + 1) << '\n';
        }
        s += v[i];
    }
}

int main() {
    cout.tie(0) -> sync_with_stdio(0);
	T = read();
	for (int i = 1; i <= T; i++) {
		int r = read();
        if (r == 1) {
            as[i] = {-1};
            continue;
        }
		q.eb(r, i);
	}
	init();
	for (int i = 2; i < N; i++) 
        BF(i);
    assert(q.empty());
	for (int i = 1; i <= T; i++) {
        __out(as[i]);
	}
}
// I love WHQ!