#include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
const int mx=456;
vector<int>g[mx];
vector<int>e[mx];
bool vise[mx*mx];
int ne;
vector<vector<int> >cycles;
stack<int>s;
bool instack[456];
int n;
int inv(int x){
  if(x<n)return x+n;
  return x-n;
}
void edge(int u,int v){
  g[u].push_back(v);
  g[v].push_back(u);
  e[u].push_back(ne);
  e[v].push_back(ne);
  vise[ne++]=false;
}
int nxt(int u){
  if(u==n-1)return n;
  if(u==n+n-1)return 0;
  return inv(u)+1;
}
void dfs(int u){
  if(instack[u]){
    vector<int>cycle;
    int v;
    do{
      v=s.top();
      instack[v]=false;
      s.pop();
      cycle.push_back(v);
    }while(v!=u);
    cycles.push_back(cycle);
    cycles.push_back(cycle);
  }
  while(!g[u].empty()){
    int v=g[u].back();
    int edge=e[u].back();
    g[u].pop_back();
    e[u].pop_back();
    if(vise[edge])continue;
    vise[edge]=true;
    s.push(u);
    instack[u]=true;
    dfs(v);
  }
}
int main(){
  int t;
  scanf("%d",&t);
  while(t--){
    scanf("%d",&n);
    assert(s.empty());
    cycles.clear();
    ne=0;
    if(n&1){
      for(int u:{0,n}){
        int v=u;
        vector<int>cycle;
        for(int i=0;i<n;i++){
          v=inv(v);
          cycle.push_back(v);
          v=nxt(v);
          cycle.push_back(v);
        }
        cycles.push_back(cycle);
      }
      vector<int>cycle;
      int u=0;
      do{
        u=nxt(u);
        cycle.push_back(u);
      }while(u!=0);
      cycles.push_back(cycle);
      for(int i=0;i<n;i++)
        for(int j=n;j<n+n;j++)
          if(nxt(i)!=j && nxt(j)!=i && inv(i)!=j)
            edge(i,j);
    }
    else{
      for(int i=0;i<n;i++)
        for(int j=n;j<n+n;j++)
          edge(i,j);
    }
    dfs(0);
    printf("%d\n",int(cycles.size()));
    for(auto cycle:cycles){      
      if(cycle[0]>=n)rotate(cycle.begin(),cycle.begin()+1,cycle.end());
      int sz=cycle.size();
      printf("%d\n",sz/2);
      for(int i=0;i<sz;i+=2){
        printf("%d %d %d\n",cycle[i] +1,cycle[(i+1)%sz] -n+1,cycle[(i-1+sz)%sz] -n+1);
      }
    }
  }
  return 0;
}