
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007 
#define int long long
#define pb push_back
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pi pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define vp vector<pair< int,int> >
#define mpi map<pair<int,int> ,int>
#define endl "\n"
#define fill(A,x) memset(A,x,sizeof A);

void solve()
{ 
  int n;
    cin>>n;
	vi pos(n+5),ar(n+5);
	vi ans;
    for(int i=1;i<=n;i++)
    {
        cin>>ar[i];
        pos[ar[i]]=i;
    }
    if(n==2)
    {
        if(pos[1]==1)cout<<0<<endl;
        else {cout<<1<<endl;cout<<1;}
        cout<<endl;
        return;
    }
    
    
    for(int i=n;i>0;i--)
    {
        if(i>n||pos[i]==i)
        continue;
        int c=pos[i];
        if(c%2!=(ans.size())%2)
        {
            while(pos[i]!=i)
            {
                int x=ar[pos[i]+1];
                ar[pos[i]]=x;ar[pos[i]+1]=i;
                ans.pb(pos[i]);
                pos[i]++;pos[x]--;
            }
        }
        else
        {
            if(c%2==0)
            {
                ans.pb(1);
                ans.pb(2);
                ans.pb(1);
                pos[ar[1]]+=2;pos[ar[3]]-=2;
                swap(ar[1],ar[3]);
                i++;
            }
            else
            {
                ans.pb(2);
                ans.pb(1);
                ans.pb(2);
                pos[ar[1]]+=2;pos[ar[3]]-=2;
                swap(ar[1],ar[3]);
                i++;
                i++;
            }
        }
    }
    
    
    int x=ans.size();
    cout<<x<<endl;
    
    
    for(auto it:ans)cout<<it<<" ";
    cout<<endl;
}

signed main()
{ 
    boost
    int test=0,t;
    cin >> t ;
    //t=1;
   while(test++ <t){
	//   cout<<"Case #"<<test<<": ";
	   solve();}
  
}
//Duodecim Ferra 

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define rrep(i,x,y) for(ll i=x;i>=y;i--)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin(),(a).end() 
#define nnn "\n"
#define spa " "
using P = pair<ll,ll>;
using graph = vector<vector<ll>>;
const int inf = 2147483647;//2*10^9
const ll INF = 9223372036854775807;//9*10^18
const ll mod = 9223372036854775800;
//cout<<fixed<<setprecision(15)<<x<<nnn;

signed main (){
    int l;cin>>l;
    vector<int>a={1,2,3,2,2,5,2,3,7,2,2,2,3,3,2,5,11};
    sort(range(a),greater<int>());
    int ans=1;
    rep(i,0,11){
        l--;
        ans*=l;
        rep(r,0,a.size()){
            if(ans%a[r]==0){
                ans/=a[r];
                a[r]=1;
            }
        }
    }
    cout<<ans<<nnn;
    return 0;
}