#include<bits/stdc++.h> using namespace std; int a[100010],b[100010]; int n; int ans=1; int cnt; int t; int main(){ cin>>t; for(int k=1;k<=t;++k){ ans=1; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); scanf("%d",&n); for(int i=0;i<n;i++)scanf("%d",&a[i]); b[ans]=a[0]; for(int i=1;i<n;i++){ if(b[ans]<a[i]){ ans++; b[ans]=a[i]; }else{ cnt=lower_bound(b,b+ans,a[i])-b; b[cnt]=a[i]; } } printf("Case #%d:\n%d\n",k,n-ans); } return 0; }