#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i = 0; i < n; i++)
#define ll long long

using namespace std;
ll n,x,tot,ans1,ans2,half;
ll memo[100002];
vector<int> v;
ll solve(ll sum,int step,int chosen)
{
   if(step==n&&(chosen==(n+1)/2||chosen==n/2)&&sum<=half) return sum;
   if(step>=n) return -10000000;
   if(memo[sum]!=-1) return memo[sum];

   ll ans=max(solve(sum+v[step],step+1,chosen+1),solve(sum,step+1,chosen));
   return memo[sum] = ans ;
}

int main()
{
     int tc;
     cin >> tc ;
     rep(qq,tc)
     {
          cin >> n ;
          v.clear();
          tot=0;
          rep(i,n)
          {
              cin >> x ;
              v.pb(x);
              tot+=x;
          }
          half = tot >> 1;

          memset(memo, -1, sizeof(memo));
          ans1 = solve(0,0,0);
          ans2=tot-ans1;
          if(ans1>ans2) swap(ans1,ans2);
          cout << "Case " << qq+1 << ": " << ans1 << " " << ans2 <<endl;

     }
     return 0;
}