#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define np next_permutation
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define vii vector<vi>
#define vb vector<bool>
#define pr pair<int,int>
#define vl vector<ll>
#define vs vector<string>
#define us unordered_map<int,int>
#define Mpq priority_queue<int>
#define mpq priority_queue<int,vi,greater<int>> 
#define eb emplace_back
#define pr pair<int,int>
#define prl pair<ll,ll>
#define vp vector<pr>
#define vpl vector<prl>
#define mkp make_pair
#define ld long double
#define vii vector<vi>
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
#define ull unsigned long long
#define prr pair<ll,int>

//#include <ext/pb_ds/tree_policy.hpp> 
//#include <ext/pb_ds/assoc_container.hpp>

//using namespace __gnu_pbds;
using namespace std;
using vi=vector<int>;

//typedef  tree<prl, null_type,less<prl>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//ordered_set s;

#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;

double epsilon=(double)1e-9;
const int N=(int)1e6+12;
int t,n,m;

const ll MX=(ll)1e18+123;
const int inf=0x3fffffff;
int a[N],b[N],cnt[N];
bool check(vl a){
   int n=a.size();
   lp(i,n-1){
      if(a[i]>a[i+1]) return 0;
      a[i+1]-=a[i];
      a[i]=0;
   }
   if(!a[n-1]) return 1;
   return 0;
}

void solve(){
   int n,j=1;
   ll ans=0;
   cin>>n;
   vi a(n+1);
   vp opr;
   lps(i,1,n+1) a[i]=i;

   for(int i=1;i<=(n+1)/2;i++){
      if(i==1){
	opr.eb(1,n);
	ans+=(n-1)*1LL*(n-1);
	swap(a[1],a[n]);
      }
      else{
	opr.eb(n-j,1);
	ans+=(ll)pow((ll)(n-j-1),2LL);
	swap(a[1],a[n-j]);
	if(i<(n+1)/2 or (i==(n+1)/2 and (n%2) == 0)){
           opr.eb(j+1,n);
           ans+=(ll)pow((ll)(n-j-1),2LL);
	   swap(a[j+1],a[n]);
	}
	j++;
      }
   }
   cout<<ans<<"\n";
   lps(i,1,n+1) cout<<a[i]<<" ";
   cout<<"\n";

   cout<<opr.size()<<"\n";
   for(int i=opr.size()-1;i>=0;i--){
      cout<<opr[i].F<<" "<<opr[i].S<<"\n";
   }

}

int main(){
   ios_base::sync_with_stdio(0);  
   cin.tie(nullptr);

   cin>>t;
   while(t--)
   solve(); 
   return 0;
}

