1 #include <cstdio>
 2 #include <cmath>
 3 #include <cstring>
 4 #include <ctime>
 5 #include <iostream>
 6 #include <algorithm>
 7 #include <set>
 8 #include <vector>
 9 #include <sstream>
10 #include <queue>
11 #include <typeinfo>
12 #include <fstream>
13 #include <map>
14 #include <stack>
15 typedef __int64 ll;
16 using namespace std;
17 const int inf = (int)1E9+10;
18 inline ll read()
19 {
20     ll x=0,f=1;
21     char ch=getchar();
22     while(ch<‘0‘||ch>‘9‘)
23     {
24         if(ch==‘-‘)f=-1;
25         ch=getchar();
26     }
27     while(ch>=‘0‘&&ch<=‘9‘)
28     {
29         x=x*10+ch-‘0‘;
30         ch=getchar();
31     }
32     return x*f;
33 }
34 
35 //*******************************
36 
37 struct ss
38 {
39     int x;
40     friend bool operator < (ss s1,ss s2)
41     {
42         return s1.x<s2.x;
43     }
44 };
45 priority_queue< ss >q;
46 int main()
47 {
48 
49     int T;
50     cin>>T;
51     int n;
52     int oo=1;
53     while(T--)
54     {
55         scanf("%d",&n);
56         for(int i=1;i<=n;i++)
57         {
58            int x=read();
59            ss xx;
60            xx.x=x;
61            q.push(xx);
62         }
63         ll ans=0;
64         while(!q.empty())
65         {
66             ss a,b;
67             a=q.top();
68             q.pop();
69             b=q.top();
70             q.pop();
71             ans+=(b.x);
72             b.x=(a.x-b.x);
73             //printf("%d\n",b.x);
74             if(b.x!=0)q.push(b);
75             if(q.size()<=2)
76             {
77                 b=q.top();
78                 q.pop();
79                // printf("%d %d\n",b.x,ans);
80                 ans+=(b.x);
81                 break;
82             }
83         }
84         while(!q.empty())q.pop();
85         printf("Case #%d: ",oo++);
86         printf("%I64d\n",ans);
87     }
88 
89     return 0;
90 }