#include<iostream> #include<algorithm> using namespace std; long long n,num,now,sum,f[1001], m; int main() { cin >> m; for(long long j = 1; j <= m; j++){ cin>>n; for(long long i=1;i<=n;i++) { cin>>num; if(num>f[now]) f[++now]=num; else { *lower_bound(f+1,f+now+1,num)=num; sum++; } } cout<<"Case #"<<j<<":"<<endl<<sum; sum=0; now=0; num=0; } return 0; }