#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define PII pair<int, int>
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int n, a[N];
void solve()
{
    cin >> n;
    vector<vector<int>> pre(65);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        for (int j = 60; j >= 0; j--)
            if (a[i] & (1ll << j))
                pre[j].push_back(i);
    }
    for (int i = 0; i <= 60; i++)
        sort(pre[i].begin(), pre[i].end());
    for (int i = 60; i >= 0; i--)
        if (pre[i].size() != 2 && pre[i].size() != 0)
        {
            cout << -1 << endl;
            return;
        }
    vector<PII> ans;
    for (int j = 60; j >= 0; j--)
    {
        if (pre[j].size() == 2)
        {
            int x = pre[j][0], y = pre[j][1];
            int tmp = 1ll << j;
            for (int i = j - 1; i >= 0; i--)
                if (lower_bound(pre[i].begin(), pre[i].end(), y) != pre[i].end() && *lower_bound(pre[i].begin(), pre[i].end(), y) == y && lower_bound(pre[i].begin(), pre[i].end(), x) != pre[i].end() && *lower_bound(pre[i].begin(), pre[i].end(), x) == x)
                {
                    pre[i].erase(lower_bound(pre[i].begin(), pre[i].end(), x));
                    pre[i].erase(lower_bound(pre[i].begin(), pre[i].end(), y));
                    tmp |= 1ll << i;
                }
            pre[j].clear();
            ans.push_back({x, tmp});
        }
    }
    cout << ans.size() << endl;
    for (auto [x, y] : ans)
        cout << x << ' ' << y << endl;
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}