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

typedef pair<int, int> pii;
const int maxn = 1e5 + 5;

int a[maxn], rk[maxn];
vector<pii> op;
inline void sw(int x, int y) { op.emplace_back(make_pair(x, y)), swap(rk[a[x]], rk[a[y]]), swap(a[x], a[y]); }

void work()
{
	int n; cin >> n; op.clear();
	for (int i = 1; i <= n; i++) cin >> a[i], rk[a[i]] = i;
	if (((n + 1) & (-n - 1)) == (n + 1) && a[n] != n) cout << "1\n"; else cout << "0\n";
	int k = 1; while ((1 << k) <= n) k++;
	for (int I = n; I; I--)
	{
		if (__builtin_popcount(I) == 1) continue;
		int i = rk[I];
		while (__builtin_popcount(a[i]) != 1 && i != a[i])
		{
			int x = i ^ ((1 << k) - 1), y = a[i] ^ ((1 << k) - 1), tmp = a[i];
			int c = x & -x, d = y & -y;
			if (!c) c = 1; if (!d) d = 1;
			if (c == d) sw(i, c), sw(c, tmp);
			else sw(i, c), sw(c, d), sw(d, tmp);
		}
	}
	for (int i = 0; i < k; i++)
		while (a[1 << i] != (1 << i)) sw((1 << i), a[1 << i]);
	cout << op.size() << "\n";
	for (auto [x, y] : op) cout << x << " " << y << "\n";
}

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

	int T; cin >> T;
	while (T--) work();
	return 0;
}