#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "RDLU";
const long long MOD2 = (long long)998244353 * (long long)998244353;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int a[22], path[22];
pair<int, int> pre[16][16][1 << 15];
int lst[1 << 15][16];
void init() {
  memset(lst, -1, sizeof lst);
  for (int(i) = 0; (i) < (int)(1 << 15); (i)++) {
    for (int j = 0; j <= 14; j++) {
      for (int z = j + 1; z <= 15; z++)
        if (i & (1 << (z - 1))) {
          lst[i][j] = z;
          break;
        }
    }
  }
}
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 0; (i) < (int)(n); (i)++) scanf("%d", a + i);
  vector<vector<vector<int>>> dp(
      n + 1, vector<vector<int>>(n + 1, vector<int>(1 << n, (1 << 30))));
  vector<int> ps(1 << n, 0);
  for (int(i) = 0; (i) < (int)(1 << n); (i)++) {
    for (int(j) = 0; (j) < (int)(n); (j)++)
      if (i & (1 << j)) ps[i] += a[j];
  }
  dp[0][0][0] = 0;
  int All = (1 << n) - 1;
  for (int i = 1; i <= n; i++) {
    for (int(j) = 0; (j) < (int)(n); (j)++)
      for (int x = 0; x < (1 << n); x++)
        if (dp[i - 1][j][x] != (1 << 30)) {
          int rs = All ^ x;
          for (int s = rs; s > 0; s = (s - 1) & rs) {
            if (dp[i - 1][j][x] < ps[s] && lst[s][j] != -1) {
              int p = lst[s][j];
              if (dp[i][p][x ^ s] > ps[s]) {
                dp[i][p][x ^ s] = ps[s];
                pre[i][p][x ^ s] = {j, x};
              }
            }
          }
        }
  }
  auto fd = [&]() {
    for (int i = n; i; i--) {
      for (int(j) = 1; (j) <= (int)(n); (j)++)
        if (dp[i][j][All] != (1 << 30)) {
          return i;
        }
    }
    return (1 << 30);
  };
  int ans = fd();
  printf("%d\n", n - ans);
  int p = n;
  while (dp[ans][p][All] == (1 << 30)) {
    p--;
  }
  for (int(j) = 0; (j) < (int)(n + 1); (j)++) path[j] = 0;
  for (int i = ans, x = All; i > 0; i--) {
    auto pr = pre[i][p][x];
    path[p - 1] = x ^ pr.second ^ (1 << (p - 1));
    p = pr.first;
    x = pr.second;
  }
  vector<bool> del(n, 0);
  for (int i = n - 1; i >= 0; i--)
    if (path[i]) {
      int N = 0;
      assert(!del[i]);
      vector<int> id(n, 0);
      for (int j = 0; j < n; j++)
        if (!del[j]) {
          id[j] = ++N;
        }
      for (int j = n - 1; j > i; j--)
        if (path[i] & (1 << j)) {
          assert(!del[j]);
          del[j] = 1;
          printf("%d %d\n", id[j], id[i]);
        }
      N = id[i];
      for (int j = i - 1; j >= 0; j--)
        if (path[i] & (1 << j)) {
          assert(!del[j]);
          del[j] = 1;
          printf("%d %d\n", id[j], N);
          N--;
        }
    }
}
int main() {
  int t = 1;
  scanf("%d", &t);
  init();
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
