#define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'

#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
	cerr << setw(4) << #x << ":: "; \
	for (auto i : x)                \
		cerr << i << " ";           \
	cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
ostream& operator<<(ostream& out, PII& x)
{
	out << x.fir << " " << x.sec << endl;
	return out;
}

const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200020;
void solve()
{
	int n;
	cin >> n;
	vector<PII> a(n + 5, {0, 0});
	for (int i = 1; i <= n; i++) {
		cin >> a[i].fir;
		a[i].sec = i;
	}
	vector<PII> ans;
	while (1) {
		sort(next(a.begin()), a.end(),
			 [&](PII x, PII y) { return x.fir > y.fir; });
		if (a[1].fir == 0)
			break;
		int high = -1;
		for (ll j = 60; j >= 0; j--) {
			if (a[1].fir >> j & 1) {
				high = j;
				break;
			}
		}
		if (a[3].fir >> high & 1) {
			cout << "-1" << el;
			return;
		}
		ll now = (1 << high);
		ans.push_back(PII(a[1].sec, now));
		a[1].fir -= now, a[2].fir -= now;
	}
	cout << ans.size() << el;
	for (auto [x, y] : ans) {
		cout << x << " " << y << el;
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}