#include <bits/stdc++.h>
using namespace std;
int a[100];

int main() {
	int t;
	cin >> t;
	int n;
	while (t--) {
		cin >> n;
		for (int i = 0; i < n; i++) {
			cin >> a[i];
		}
		int cnt = 0;
		for (int i = 0; i < n - 1; i++) {
			for (int j = i + 1; j < n; j++) {
				if (a[i] > a[j])
					cnt++;
			}
		}
		printf("Optimal train swapping takes %d swaps.\n", cnt);
	}
	return 0;
}