#include<iostream>
#include<algorithm>
#include<vector>
#include<cassert>
#include<atcoder/fenwicktree>
using namespace std;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T;cin>>T;
	for(;T--;)
	{
		int N;cin>>N;
		atcoder::fenwick_tree<int>BIT(N);
		long long x=0;
		vector<int>L,R;
		for(int i=0;i<N;i++)
		{
			int P;cin>>P;P--;
			int l=BIT.sum(0,P);
			int r=i-l;
			bool fl;
			if(l<r)fl=true;
			else if(r<l)fl=false;
			else
			{
				if(L.empty())
				{
					if(R.empty())fl=true;
					else if(P<R[0])fl=true;
					else fl=false;
				}
				else
				{
					if(P<L.back())fl=true;
					else fl=false;
				}
			}
			if(fl)
			{
				L.push_back(P);
				x+=l;
			}
			else
			{
				R.push_back(P);
				x+=r;
			}
			BIT.add(P,1);
		}
		cout<<x<<"\n";
		reverse(L.begin(),L.end());
		for(int r:R)L.push_back(r);
		for(int i=0;i<N;i++)cout<<L[i]+1<<(i+1==N?"\n":" ");
	}
}