#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long LL;
typedef unsigned long long ULL;
LL Gcd(LL a, LL b){if (b == 0) return a; return Gcd(b , a%b);}
LL Lcm(LL a, LL b){ return a/Gcd(a,b)*b;}
inline int read(){
int f = 1, x = 0;char ch = getchar();
while (ch > '9' || ch < '0'){if (ch == '-')f = -f;ch = getchar();}
while (ch >= '0' && ch <= '9'){x = x * 10 + ch - '0';ch = getchar();}
return x * f;
}
const int maxn = 1e6 + 10;
int a[maxn];
int main(){
//freopen("/Users/chutong/ACM/data.in","r",stdin);
//freopen("/Users/chutong/ACM/data.out","w",stdout);
int T = read(),kase = 1;
while(T--){
int n = read();
for(int i=1; i<=n; i++){
a[i] = read();
}
sort(a+1,a+n+1);
LL ans = 0,cnt = 0;
for(int i=n; i>=1; i--){
if (cnt == 2){
cnt = 0;
}else{
ans += a[i];
cnt++;
}
}
printf("Case #%d: %lld\n",kase++,ans);
}
return 0;
}