#include<stdio.h>
int main()
{
    int t,n,i,j,ara[1000],low_jump,high_jump;
    scanf("%d",&t);
    for(i=1;i<=t;i++)
    {
        scanf("%d",&n);
        for(j=0;j<n;j++)
        {
            scanf("%d",&ara[j]);
        }
        low_jump=0;
        high_jump=0;
        for(j=0;j<n-1;j++)
        {
            if(ara[j]==ara[j+1])
            {
                continue;
            }
            if(ara[j]>ara[j+1])
            {
               low_jump=low_jump+1;
            }
            else
            {
                high_jump=high_jump+1;
            }
        }
        printf("Case %d: %d %d\n",i,high_jump,low_jump);
    }
    return 0;
}