1 //2016.8.16
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<algorithm>
 5 
 6 using namespace std;
 7 
 8 int a[15];
 9 
10 int main()
11 {
12     int T, n, kase = 0, sum, mx, ans;
13     cin>>T;
14     while(T--)
15     {
16         sum = mx = 0;
17         scanf("%d", &n);
18         for(int i = 0; i < n; i++)
19         {
20             scanf("%d", &a[i]);
21             sum += a[i];
22             if(mx<a[i])mx = a[i];
23         }
24         printf("Case #%d: ", ++kase);
25         ans = min(sum/2, 2*(sum-mx)+1);
26         printf("%d\n", ans);
27     }
28 
29     return 0;
30 }