#include<stdio.h>
#include<iostream>
using namespace std;
int max(int a, int b)
{
return (a>b)? a:b;
}
int retMaxCombination(int arr[], int n, int curr, int prev)
{
if(curr >= n)
return 0;
if(arr[curr] > prev)
return max(1+retMaxCombination(arr, n, curr+1, arr[curr]), retMaxCombination(arr, n, curr+1, prev));
else
return retMaxCombination(arr, n, curr+1, prev);
}
int main()
{
int t;
cin>>t;
for(int i=0; i<t; i++)
{
int n;
cin>>n;
int arr[n];
for(int j=0; j<n; j++)
cin>>arr[j];
cout<<"Case "<<i+1<<" :\n"<<retMaxCombination(arr, n, 0, -1)<<endl;
}
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8aW9zdHJlYW0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWF4KGludCBhLCBpbnQgYikKewoJcmV0dXJuIChhPmIpPyBhOmI7Cn0KCmludCByZXRNYXhDb21iaW5hdGlvbihpbnQgYXJyW10sIGludCBuLCBpbnQgY3VyciwgaW50IHByZXYpCnsKCWlmKGN1cnIgPj0gbikKCQlyZXR1cm4gMDsKCWlmKGFycltjdXJyXSA+IHByZXYpCgkJcmV0dXJuIG1heCgxK3JldE1heENvbWJpbmF0aW9uKGFyciwgbiwgY3VycisxLCBhcnJbY3Vycl0pLCByZXRNYXhDb21iaW5hdGlvbihhcnIsIG4sIGN1cnIrMSwgcHJldikpOwoJZWxzZQoJCXJldHVybiByZXRNYXhDb21iaW5hdGlvbihhcnIsIG4sIGN1cnIrMSwgcHJldik7Cn0KCmludCBtYWluKCkKewoJaW50IHQ7CgljaW4+PnQ7CgoJZm9yKGludCBpPTA7IGk8dDsgaSsrKQoJewoJCWludCBuOwoJCWNpbj4+bjsKCgkJaW50IGFycltuXTsKCQlmb3IoaW50IGo9MDsgajxuOyBqKyspCgkJCWNpbj4+YXJyW2pdOwoKCQljb3V0PDwiQ2FzZSAiPDxpKzE8PCIgOlxuIjw8cmV0TWF4Q29tYmluYXRpb24oYXJyLCBuLCAwLCAtMSk8PGVuZGw7Cgl9CglyZXR1cm4gMDsKfQ==