/*
   ACM Western European Region, 1994-95
   Problem H, Train Swapping

   Ed Karrels, October 1996
*/

#include <stdio.h>

#define SWAP(x, y) {t=x; x=y; y=t;}

int main() {
   int a[50], len, nswaps, i, j, t;
   int n, nt;

   scanf("%d", &nt);
   for (tn=0; tn<nt; tn++) {
      scanf("%d", &len);
      for (i=0; i<len; i++) {
	 scanf("%d", a+i);
      }
      nswaps = 0;
      for (i=0; i<len-1; i++) {
	 for (j=len-1; j>i; j--) {
	    if (a[j] < a[j-1]) {
	       SWAP(a[j], a[j-1]);
	       nswaps++;
	    }
	 }
      }
      printf("Optimal train swapping takes %d swaps.\n", nswaps);
   }

   return 0;
}