#include <bits/stdc++.h>

using namespace std;

constexpr int maxn = 125;
constexpr int mod = (int) 1e9 + 7;

bitset<mod> f;
int t;
int r[10];
vector<int> rid;
int w[126][126], iw[126][126], inv[126];
vector<pair<int, int>> g[126], h[126];

void dfs(int x, int used, int res, const int &n) {
  f[res] = 1;
  for (int i = x; i <= min(n - 2, 6); ++i) {
    if (used + i > n - 2) {
      break;
    }
    dfs(i, used + i, 1LL * res * w[n - 2][i] % mod, n);
  }
}

void dfs_b(int x, int used, int res, const int &n) {
  for (int i : rid) {
    if (f[1LL * r[i] * inv[n] % mod * inv[n - 1] % mod * res % mod]) {
      g[used].emplace_back(i, res);
    }
  }
  for (int i = x; i <= n - 2; ++i) {
    if (used + i > n - 2) {
      break;
    }
    dfs_b(i, used + i, 1LL * res * iw[n - 2][i] % mod, n);
  }
}

int ans_n[10];
vector<int> tmp;
vector<int> siz[10];

void dfs_chk(int x, int used, int res, const int &n) {
  for (auto [i, v] : g[n - 2 - used]) {
    if (1LL * res * n % mod * (n - 1) % mod == 1LL * r[i] * v % mod) {
      ans_n[i] = n;
      siz[i] = tmp;
      h[n - 2 - used].emplace_back(i, v);
    }
  }
  for (int i = x; i <= min(6, n - 2); ++i) {
    if (used + i > n - 2) {
      break;
    }
    tmp.push_back(i);
    dfs_chk(i, used + i, 1LL * res * w[n - 2][i] % mod, n);
    tmp.pop_back();
  }
}

void dfs_rem(int x, int used, int res, const int &n) {
  for (auto [i, v] : h[used]) {
    if (res == v) {
      for (int u : tmp) {
        siz[i].push_back(u);
      }
    }
  }
  for (int i = x; i <= n - 2; ++i) {
    if (used + i > n - 2) {
      break;
    }
    tmp.push_back(i);
    dfs_rem(i, used + i, 1LL * res * iw[n - 2][i] % mod, n);
    tmp.pop_back();
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  cin >> t;
  for (int i = 0; i < t; ++i) {
    cin >> r[i];
    if (r[i] == 1) {
      ans_n[i] = 1;
    } else if (r[i] == 2) {
      ans_n[i] = 2;
    } else {
      rid.push_back(i);
    }
  }
  
  inv[1] = 1;
  for (int i = 2; i <= 125; ++i) {
    inv[i] = 1LL * (mod - mod / i) * inv[mod % i] % mod;
  }
  for (int i = 1; i <= 125; ++i) {
    w[i][0] = iw[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      w[i][j] = 1LL * w[i][j - 1] * (i - j + 1) % mod;
      iw[i][j] = 1LL * iw[i][j - 1] * inv[i - j + 1] % mod;
    }
  }
  
  auto clk = clock();
  for (int n = 3; n <= maxn; ++n) {
    if (rid.empty()) {
      break;
    }
    f.reset();
    for (int i = 0; i <= n; ++i) {
      g[i].clear();
      h[i].clear();
    }
    dfs(1, 0, 1, n);
    dfs_b(7, 0, 1, n);
    dfs_chk(1, 0, 1, n);
    assert(tmp.empty());
    dfs_rem(7, 0, 1, n);
    for (int i = 0; i < t; ++i) {
      if (ans_n[i] != 0 && find(rid.begin(), rid.end(), i) != rid.end()) {
        rid.erase(find(rid.begin(), rid.end(), i));
      }
    }
  }
  cerr << "Elp: " << clock() - clk << '\n';
  
  for (int i = 0; i < t; ++i) {
    cout << ans_n[i] << '\n';
    if (ans_n[i] == 2) {
      cout << "1 2" << '\n';
    } else if (ans_n[i] != 1) {
      cout << "1 2" << '\n';
      int lst = 2;
      for (int k : siz[i]) {
        int now = lst;
        while (k--) {
          ++now;
          cout << lst << ' ' << now << '\n';
        }
        lst = now;
      }
    }
  }
}