#include <bits/stdc++.h>
#define mkp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
template <typename T>
inline void in (T &x) {
    char c; int f=1;
    do {c=getchar (); f=c=='-'?-1:f;} while (c>'9' || c<'0');
    for (x=0;c>='0' && c<='9';c=getchar ()) x=(x<<1)+(x<<3)+(c^48);
    x*=f;
}
template <typename T>
inline void out (T x,char c) {
    if (x==0) {putchar ('0'),putchar (c); return ;}
    if (x<0) putchar ('-'),x=-x;
    int sta[25],k=0;
    while (x) sta[++k]=x%10,x/=10;
    while (k) putchar (sta[k--]+'0');
    putchar (c);
}

const int N=1e3+100; 
int n,m;
int a[N],d[N];

int t[N];
inline void update (int x,int k) {for (int i=x;i<=m;i+=(i&-i)) t[i]+=k;}
inline int query (int x) {int res=0; for (int i=x;i;i-=(i&-i)) res+=t[i]; return res;}

inline void solve (int f[]) {
	memset (f,0,sizeof (f));
	memset (t,0,sizeof (t));
	int sum=0;
	for (int i=1;i<=n;++i) {
		sum=query (m)-query (a[i]);
		f[i]=sum;
		update (a[i],1);
	}
}

int f1[N],f2[N];
inline void work () {
	in (n);
	for (int i=1;i<=n;++i) in (a[i]),d[i]=a[i];
	sort (d+1,d+n+1); m=unique (d+1,d+n+1)-d-1;
	for (int i=1;i<=n;++i) a[i]=lower_bound (d+1,d+m+1,a[i])-d;
	
	solve (f1);
	for (int i=1;i<=n/2;++i) swap (a[i],a[n+1-i]);
	solve (f2);
	int ans=1e9;
	for (int i=0;i<=n;++i) ans=min (ans,f1[i]+f2[n-i]);
	out (ans,'\n');
}

int main () {
	int test; in (test); for (int i=1;i<=test;++i) {
		printf ("Case #%d: ",i);
		work ();
	}
    return 0;
}