#include<iostream>
using namespace std;
long long int arr[1000000],dp[1000000];
long long int max(long long a,long long b)
{
if(a>b)
return a;
else
return b;
}
main()
{
int test;
cin>>test;
int k=0;
while(test--)
{
int n,i;
k++;
cin>>n;
if(n==0)
{
cout<<"Case "<<k<<":"<<0<<endl;
continue;
}
for(i=0;i<n;i++)
{
cin>>arr[i];
}
dp[n-1]=arr[n-1];
dp[n-2]=arr[n-2];
dp[n-3]=dp[n-1]+arr[n-3];
for(i=n-4;i>=0;i--)
{
dp[i]=arr[i]+max(dp[i+2],dp[i+3]);
}
long long max=dp[0];
/* for(i=0;i<n;i++)
{
cout<<dp[i]<<",";
}
cout<<endl;*/
for(i=0;i<n;i++)
{
if(max<dp[i])
max=dp[i];
}
cout<<"Case "<<k<<":"<<max<<endl;
}
}
