#include <bits/stdc++.h>
using namespace std;
//*/
#include <atcoder/all>
using namespace atcoder;
//*/
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,a,b) for(int i=a;i<b;i++)
#define ALL(x) (x).begin(),(x).end()
#define dbgv(x); for(auto now : x) cout << now << " "; cout << endl;
//using P = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
//*/
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vint;


void solve(){
  int n; cin >> n;
  vint p(n); rep(i,n) cin >> p[i];
  fenwick_tree<int> fw(n+1);
  int c = 0;
  deque<int> ans;
  ans.push_back(p[0]);
  fw.add(p[0],1);
  rep(i,n-1){
    int now = p[i+1];
    int m = fw.sum(0,now);
    int M = ans.size()-m;
    //cout << "l : +" << m << " r : +" << M << endl; 
    if(M > m){
      c += m;
      ans.push_front(now);
    }else if(M < m){
      c += M;
      ans.push_back(now);
    }else{
      //cout << "! : " << now << endl; 
      if(ans[0] > now) ans.push_front(now);
      else ans.push_back(now);
      c += m;
    }
    fw.add(now,1);
  }
  cout << c << endl;
  for(auto now : ans) cout << now << " "; cout << endl;
  //rep(i,ans.size()) cout << ans[i] << (ans.size()-1 == i ? "\n" : " ");
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1; cin >> t;
  rep(_,t) solve();
}